/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:53:45,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:53:45,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:53:45,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:53:45,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:53:45,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:53:45,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:53:45,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:53:45,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:53:45,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:53:45,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:53:45,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:53:45,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:53:45,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:53:45,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:53:45,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:53:45,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:53:45,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:53:45,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:53:45,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:53:45,065 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:53:45,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:53:45,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:53:45,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:53:45,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:53:45,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:53:45,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:53:45,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:53:45,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:53:45,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:53:45,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:53:45,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:53:45,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:53:45,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:53:45,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:53:45,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:53:45,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:53:45,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:53:45,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:53:45,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:53:45,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:53:45,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:53:45,084 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:53:45,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:53:45,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:53:45,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:53:45,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:53:45,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:53:45,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:53:45,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:53:45,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:53:45,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:53:45,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:53:45,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:53:45,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:53:45,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:53:45,097 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:53:45,097 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:53:45,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:53:45,097 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:53:45,097 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:53:45,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:53:45,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:53:45,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:53:45,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:53:45,274 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:53:45,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2022-04-15 06:53:45,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df93d20/80381e2f85ca4d478d260c74732c0cb6/FLAG3737b489b [2022-04-15 06:53:45,672 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:53:45,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2022-04-15 06:53:45,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df93d20/80381e2f85ca4d478d260c74732c0cb6/FLAG3737b489b [2022-04-15 06:53:45,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df93d20/80381e2f85ca4d478d260c74732c0cb6 [2022-04-15 06:53:45,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:53:45,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:53:45,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:53:45,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:53:45,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:53:45,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100e81ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45, skipping insertion in model container [2022-04-15 06:53:45,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:53:45,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:53:45,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2022-04-15 06:53:45,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:53:45,806 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:53:45,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2022-04-15 06:53:45,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:53:45,823 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:53:45,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45 WrapperNode [2022-04-15 06:53:45,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:53:45,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:53:45,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:53:45,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:53:45,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:53:45,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:53:45,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:53:45,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:53:45,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (1/1) ... [2022-04-15 06:53:45,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:53:45,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:45,874 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:53:45,875 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:53:45,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:53:45,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:53:45,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:53:45,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:53:45,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:53:45,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:53:45,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:53:45,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:53:45,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:53:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:53:45,938 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:53:45,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:53:46,037 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:53:46,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:53:46,042 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:53:46,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:53:46 BoogieIcfgContainer [2022-04-15 06:53:46,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:53:46,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:53:46,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:53:46,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:53:46,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:53:45" (1/3) ... [2022-04-15 06:53:46,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@896484c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:53:46, skipping insertion in model container [2022-04-15 06:53:46,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:53:45" (2/3) ... [2022-04-15 06:53:46,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@896484c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:53:46, skipping insertion in model container [2022-04-15 06:53:46,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:53:46" (3/3) ... [2022-04-15 06:53:46,048 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_9.c [2022-04-15 06:53:46,050 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:53:46,051 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:53:46,076 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:53:46,080 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:53:46,080 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:53:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:53:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:53:46,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:46,102 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:46,127 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-15 06:53:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607618687] [2022-04-15 06:53:46,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:53:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-15 06:53:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:46,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168188301] [2022-04-15 06:53:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 06:53:46,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 06:53:46,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 06:53:46,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:46,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 06:53:46,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 06:53:46,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 06:53:46,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-15 06:53:46,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 500000; {23#true} is VALID [2022-04-15 06:53:46,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 06:53:46,319 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24#false} is VALID [2022-04-15 06:53:46,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 06:53:46,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 06:53:46,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 06:53:46,320 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:53:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:46,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168188301] [2022-04-15 06:53:46,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168188301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:46,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:46,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:53:46,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:46,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607618687] [2022-04-15 06:53:46,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607618687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:46,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:46,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:53:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080776921] [2022-04-15 06:53:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:53:46,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:46,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:46,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:53:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:53:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:53:46,374 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,418 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 06:53:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:53:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:53:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 06:53:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 06:53:46,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 06:53:46,457 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:53:46,462 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:53:46,463 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 06:53:46,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:53:46,469 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:46,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 06:53:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 06:53:46,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:46,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,496 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,496 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,497 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 06:53:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:53:46,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:46,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:46,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 06:53:46,498 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 06:53:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,499 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 06:53:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:53:46,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:46,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:46,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:46,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 06:53:46,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 06:53:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:46,502 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 06:53:46,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 06:53:46,515 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:53:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:53:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:53:46,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:46,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:46,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:53:46,516 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-15 06:53:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987998685] [2022-04-15 06:53:46,517 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:53:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-15 06:53:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:46,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467805170] [2022-04-15 06:53:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-15 06:53:46,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 06:53:46,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 06:53:46,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:46,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-15 06:53:46,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 06:53:46,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 06:53:46,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret4 := main(); {147#true} is VALID [2022-04-15 06:53:46,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0;~y~0 := 500000; {152#(= main_~x~0 0)} is VALID [2022-04-15 06:53:46,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 < 1000000); {148#false} is VALID [2022-04-15 06:53:46,565 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {148#false} is VALID [2022-04-15 06:53:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-15 06:53:46,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-15 06:53:46,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-15 06:53:46,566 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:53:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:46,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467805170] [2022-04-15 06:53:46,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467805170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:46,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:46,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:53:46,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:46,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987998685] [2022-04-15 06:53:46,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987998685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:46,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:46,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:53:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089309616] [2022-04-15 06:53:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:53:46,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:46,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:46,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:53:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:53:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:53:46,630 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,721 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 06:53:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:53:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:53:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 06:53:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 06:53:46,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 06:53:46,744 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:53:46,745 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:53:46,745 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:53:46,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:53:46,746 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:46,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:53:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:53:46,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:46,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,750 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,750 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,751 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:53:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:53:46,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:46,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:46,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:53:46,752 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:53:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:46,752 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:53:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:53:46,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:46,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:46,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:46,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 06:53:46,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 06:53:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:46,754 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 06:53:46,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 06:53:46,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:53:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:53:46,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:46,769 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:46,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:53:46,769 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:46,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-15 06:53:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [316546190] [2022-04-15 06:53:48,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:48,986 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-15 06:53:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:48,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962308281] [2022-04-15 06:53:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:49,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-15 06:53:49,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 06:53:49,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 06:53:49,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:49,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-15 06:53:49,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 06:53:49,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 06:53:49,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret4 := main(); {262#true} is VALID [2022-04-15 06:53:49,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0;~y~0 := 500000; {267#(= main_~x~0 0)} is VALID [2022-04-15 06:53:49,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} [47] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10))) (or .cse0 (and (< v_main_~x~0_10 500001) (< v_main_~x~0_11 v_main_~x~0_10)) (and .cse0 (<= 500000 v_main_~x~0_11)))) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[main_~x~0] {268#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:49,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(<= main_~x~0 500000)} [46] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-15 06:53:49,036 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {263#false} is VALID [2022-04-15 06:53:49,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-15 06:53:49,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-15 06:53:49,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 06:53:49,036 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:53:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962308281] [2022-04-15 06:53:49,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962308281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:49,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:49,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:53:49,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [316546190] [2022-04-15 06:53:49,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [316546190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:49,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:49,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:53:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765160024] [2022-04-15 06:53:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:49,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:53:49,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:49,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:49,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:53:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:49,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:53:49,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:53:49,095 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:49,174 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:53:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:53:49,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:53:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 06:53:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 06:53:49,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 06:53:49,194 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:53:49,195 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:53:49,195 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:53:49,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:53:49,196 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:49,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:53:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:53:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:53:49,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:49,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,203 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,203 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:49,204 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:53:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:53:49,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:49,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:49,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:53:49,204 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:53:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:49,205 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:53:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:53:49,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:49,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:49,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:49,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:53:49,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 06:53:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:49,207 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:53:49,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:49,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:53:49,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:53:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:53:49,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:49,222 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:49,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:53:49,222 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-04-15 06:53:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:49,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338978667] [2022-04-15 06:53:53,315 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:53,395 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:57,577 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:57,708 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:57,710 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 603671471, now seen corresponding path program 1 times [2022-04-15 06:53:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:57,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267062758] [2022-04-15 06:53:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:57,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 06:53:57,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:53:57,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:53:57,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:57,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 06:53:57,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:53:57,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:53:57,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-15 06:53:57,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {395#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:53:57,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:53:57,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:53:57,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {397#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:57,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:53:57,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {399#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:53:57,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {400#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:53:57,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:53:57,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:53:57,831 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:53:57,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267062758] [2022-04-15 06:53:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267062758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356556358] [2022-04-15 06:53:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:57,832 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:53:57,847 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:53:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:57,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:53:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:57,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:58,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 06:53:58,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 06:53:58,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:53:58,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:53:58,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-15 06:53:58,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {420#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:53:58,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (<= main_~x~0 0) (= main_~y~0 500000))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:53:58,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:53:58,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (= main_~y~0 500000) (< main_~x~0 500001))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {431#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:58,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {435#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:53:58,422 INFO L272 TraceCheckUtils]: 10: Hoare triple {435#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:58,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:53:58,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:53:58,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:53:58,423 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:53:58,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:58,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:53:58,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:53:58,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {443#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:53:58,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {439#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:58,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [48] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:53:58,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [51] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_20)) (.cse1 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not (< v_main_~x~0_20 1000000))) .cse1 .cse2) (and (< v_main_~x~0_20 v_main_~x~0_19) (= (+ v_main_~x~0_20 v_main_~y~0_6) (+ v_main_~x~0_19 v_main_~y~0_7)) (< v_main_~x~0_19 1000001) .cse0) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_20, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_19, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {462#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:58,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [50] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:58,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [49] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17))) (or (and .cse0 (<= 500000 v_main_~x~0_18)) .cse0 (and (< v_main_~x~0_17 500001) (< v_main_~x~0_18 v_main_~x~0_17)))) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[main_~x~0] {466#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:58,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0;~y~0 := 500000; {473#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:53:58,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret4 := main(); {390#true} is VALID [2022-04-15 06:53:58,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:53:58,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:53:58,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-15 06:53:58,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 06:53:58,808 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:53:58,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356556358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:58,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:58,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:53:58,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:58,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338978667] [2022-04-15 06:53:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338978667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:58,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:53:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896142796] [2022-04-15 06:53:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:53:58,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:58,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:58,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:58,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:53:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:58,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:53:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:53:58,960 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:59,222 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 06:53:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:53:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:53:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 06:53:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 06:53:59,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-15 06:53:59,259 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:53:59,259 INFO L225 Difference]: With dead ends: 31 [2022-04-15 06:53:59,259 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:53:59,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:53:59,260 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:59,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:53:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:53:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:53:59,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:59,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,278 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,279 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:59,280 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:53:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:53:59,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:59,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:59,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:53:59,282 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:53:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:59,286 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:53:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:53:59,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:59,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:59,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:59,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 06:53:59,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-15 06:53:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:59,288 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 06:53:59,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:59,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 06:53:59,309 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:53:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:53:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:53:59,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:59,310 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:59,330 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:53:59,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:59,527 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1662437453, now seen corresponding path program 2 times [2022-04-15 06:53:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:59,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198951636] [2022-04-15 06:54:03,620 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:03,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:07,824 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:07,969 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:07,970 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1641763665, now seen corresponding path program 1 times [2022-04-15 06:54:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:07,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190084921] [2022-04-15 06:54:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:08,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-15 06:54:08,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-15 06:54:08,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-15 06:54:08,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:08,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-15 06:54:08,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-15 06:54:08,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-15 06:54:08,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-15 06:54:08,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {660#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:08,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:08,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:08,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {662#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:08,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {662#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:54:08,105 INFO L272 TraceCheckUtils]: 10: Hoare triple {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {664#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:08,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {665#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:08,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {656#false} is VALID [2022-04-15 06:54:08,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-15 06:54:08,106 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:54:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190084921] [2022-04-15 06:54:08,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190084921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693765919] [2022-04-15 06:54:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:08,107 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:54:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:08,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:08,136 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:54:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:08,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:08,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2022-04-15 06:54:08,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-15 06:54:08,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-15 06:54:08,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-15 06:54:08,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-15 06:54:08,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {685#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:08,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#(and (<= main_~x~0 0) (= main_~y~0 500000))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:08,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:08,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(and (= main_~y~0 500000) (< main_~x~0 500001))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {696#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:08,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {700#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:08,580 INFO L272 TraceCheckUtils]: 10: Hoare triple {700#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:08,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:08,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {656#false} is VALID [2022-04-15 06:54:08,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-15 06:54:08,581 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:54:08,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:08,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#false} assume !false; {656#false} is VALID [2022-04-15 06:54:08,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {708#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {656#false} is VALID [2022-04-15 06:54:08,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:08,961 INFO L272 TraceCheckUtils]: 10: Hoare triple {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:08,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [52] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {663#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:54:08,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [55] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_39)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_39 v_main_~x~0_38))) (or (let ((.cse0 (+ v_main_~x~0_39 v_main_~y~0_16))) (and (< .cse0 (+ v_main_~y~0_17 1000001)) (< v_main_~y~0_17 v_main_~y~0_16) .cse1 (= (+ v_main_~x~0_38 v_main_~y~0_17) .cse0))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_39 1000000)) (not .cse1)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_38, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {727#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:08,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [54] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:08,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [53] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36))) (or (and .cse0 (not (< v_main_~x~0_37 500000))) .cse0 (and (< v_main_~x~0_36 500001) (< v_main_~x~0_37 v_main_~x~0_36)))) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_36} AuxVars[] AssignedVars[main_~x~0] {731#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:08,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {655#true} ~x~0 := 0;~y~0 := 500000; {738#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:08,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret4 := main(); {655#true} is VALID [2022-04-15 06:54:08,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #41#return; {655#true} is VALID [2022-04-15 06:54:08,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2022-04-15 06:54:08,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {655#true} is VALID [2022-04-15 06:54:08,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2022-04-15 06:54:08,985 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:54:08,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693765919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:08,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:08,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:09,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198951636] [2022-04-15 06:54:09,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198951636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:54:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017705047] [2022-04-15 06:54:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:54:09,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:09,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:09,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:54:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:54:09,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:54:09,169 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:09,456 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 06:54:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:54:09,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:54:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:54:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:54:09,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 06:54:09,492 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:54:09,493 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:54:09,493 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:54:09,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:54:09,493 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:09,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:54:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:54:09,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:09,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,523 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,523 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:09,524 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:54:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:54:09,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:09,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:09,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:54:09,525 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:54:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:09,525 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:54:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:54:09,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:09,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:09,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:09,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 06:54:09,526 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-04-15 06:54:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:09,527 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 06:54:09,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:09,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 06:54:09,550 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:54:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:54:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:54:09,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:09,553 INFO L499 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:09,570 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:54:09,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:09,770 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash 361874638, now seen corresponding path program 3 times [2022-04-15 06:54:09,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:09,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569127973] [2022-04-15 06:54:11,890 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:11,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:16,046 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:16,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:16,146 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash 407768495, now seen corresponding path program 1 times [2022-04-15 06:54:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:16,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507192578] [2022-04-15 06:54:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:16,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-15 06:54:16,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-15 06:54:16,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-15 06:54:16,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:16,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-15 06:54:16,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-15 06:54:16,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-15 06:54:16,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-15 06:54:16,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {930#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:16,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:16,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:16,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {932#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:54:16,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:16,270 INFO L272 TraceCheckUtils]: 10: Hoare triple {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {934#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:16,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {935#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:16,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {935#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {926#false} is VALID [2022-04-15 06:54:16,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-15 06:54:16,271 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:54:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:16,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507192578] [2022-04-15 06:54:16,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507192578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:16,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13302466] [2022-04-15 06:54:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:16,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:16,276 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:54:16,276 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:54:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:16,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:16,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:16,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-15 06:54:16,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-15 06:54:16,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-15 06:54:16,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-15 06:54:16,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-15 06:54:16,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {955#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:16,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#(and (<= main_~x~0 0) (= main_~y~0 500000))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:16,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:16,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#(and (= main_~y~0 500000) (< main_~x~0 500001))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {966#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:16,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {966#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {970#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:16,709 INFO L272 TraceCheckUtils]: 10: Hoare triple {970#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:16,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:16,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-15 06:54:16,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-15 06:54:16,709 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:54:16,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:17,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-04-15 06:54:17,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {926#false} is VALID [2022-04-15 06:54:17,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {974#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {978#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:17,010 INFO L272 TraceCheckUtils]: 10: Hoare triple {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:17,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [56] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {933#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:17,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [59] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_28 v_main_~y~0_27)) (.cse0 (<= 500000 v_main_~x~0_60)) (.cse3 (= v_main_~x~0_60 v_main_~x~0_59))) (or (let ((.cse1 (+ v_main_~x~0_60 v_main_~y~0_27))) (and .cse0 (= .cse1 (+ v_main_~x~0_59 v_main_~y~0_28)) (< .cse1 (+ v_main_~y~0_28 1000001)) (< v_main_~y~0_28 v_main_~y~0_27))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_60 1000000)) (not .cse0)) .cse3))) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_59, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {997#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:17,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [58] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:17,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [57] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57))) (or .cse0 (and (< v_main_~x~0_58 v_main_~x~0_57) (< v_main_~x~0_57 500001)) (and .cse0 (not (< v_main_~x~0_58 500000))))) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_57} AuxVars[] AssignedVars[main_~x~0] {1001#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:17,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {925#true} ~x~0 := 0;~y~0 := 500000; {1008#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:17,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#true} call #t~ret4 := main(); {925#true} is VALID [2022-04-15 06:54:17,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {925#true} {925#true} #41#return; {925#true} is VALID [2022-04-15 06:54:17,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#true} assume true; {925#true} is VALID [2022-04-15 06:54:17,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {925#true} is VALID [2022-04-15 06:54:17,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID [2022-04-15 06:54:17,013 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:54:17,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13302466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:17,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:17,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:17,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569127973] [2022-04-15 06:54:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569127973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:17,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:17,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:54:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652237088] [2022-04-15 06:54:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:54:17,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:17,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:17,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:54:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:54:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:54:17,251 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:17,554 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 06:54:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:54:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:54:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:54:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:54:17,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 06:54:17,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:17,584 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:54:17,584 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:54:17,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:54:17,585 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:17,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:54:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 06:54:17,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:17,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,612 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,612 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:17,612 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 06:54:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:54:17,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:17,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:17,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 06:54:17,613 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 06:54:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:17,614 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 06:54:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:54:17,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:17,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:17,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:17,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 06:54:17,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2022-04-15 06:54:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:17,615 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 06:54:17,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:17,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 06:54:17,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:54:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:54:17,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:17,637 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:17,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:17,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:17,854 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 105609001, now seen corresponding path program 4 times [2022-04-15 06:54:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:17,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [718976589] [2022-04-15 06:54:21,927 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:21,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:22,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:22,196 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1837666641, now seen corresponding path program 1 times [2022-04-15 06:54:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814507298] [2022-04-15 06:54:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {1221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-15 06:54:22,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-15 06:54:22,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-15 06:54:22,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:22,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-15 06:54:22,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-15 06:54:22,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-15 06:54:22,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-15 06:54:22,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1215#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:22,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:22,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:22,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1217#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:22,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:22,310 INFO L272 TraceCheckUtils]: 10: Hoare triple {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1219#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:22,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1220#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:22,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {1220#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1211#false} is VALID [2022-04-15 06:54:22,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-15 06:54:22,310 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:54:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814507298] [2022-04-15 06:54:22,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814507298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56179975] [2022-04-15 06:54:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:22,314 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:54:22,314 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:54:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:22,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-15 06:54:22,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-15 06:54:22,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-15 06:54:22,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-15 06:54:22,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-15 06:54:22,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1240#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:22,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {1240#(and (<= main_~x~0 0) (= main_~y~0 500000))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:22,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:22,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {1244#(and (= main_~y~0 500000) (< main_~x~0 500001))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1251#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:22,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {1251#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1255#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:22,722 INFO L272 TraceCheckUtils]: 10: Hoare triple {1255#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:22,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:22,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1211#false} is VALID [2022-04-15 06:54:22,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-15 06:54:22,723 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:54:22,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:23,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-15 06:54:23,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1211#false} is VALID [2022-04-15 06:54:23,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:23,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:23,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1282#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [60] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1218#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:23,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [63] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_82))) (or (and (= v_main_~y~0_39 v_main_~y~0_40) (= v_main_~x~0_81 v_main_~x~0_82) (or (not .cse0) (not (< v_main_~x~0_82 1000000)))) (and (< v_main_~x~0_81 1000001) .cse0 (= (+ v_main_~x~0_82 v_main_~y~0_39) (+ v_main_~x~0_81 v_main_~y~0_40)) (< v_main_~x~0_82 v_main_~x~0_81)) (and (= v_main_~y~0_40 v_main_~y~0_39) (= v_main_~x~0_82 v_main_~x~0_81)))) InVars {main_~x~0=v_main_~x~0_82, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_81, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1282#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:23,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [62] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:23,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [61] L11-2-->L10-2_primed: Formula: (or (and (not (< v_main_~x~0_80 500000)) (= v_main_~x~0_79 v_main_~x~0_80)) (= v_main_~x~0_80 v_main_~x~0_79) (and (< v_main_~x~0_79 500001) (< v_main_~x~0_80 v_main_~x~0_79))) InVars {main_~x~0=v_main_~x~0_80} OutVars{main_~x~0=v_main_~x~0_79} AuxVars[] AssignedVars[main_~x~0] {1286#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:23,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~x~0 := 0;~y~0 := 500000; {1293#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:23,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret4 := main(); {1210#true} is VALID [2022-04-15 06:54:23,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #41#return; {1210#true} is VALID [2022-04-15 06:54:23,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-15 06:54:23,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1210#true} is VALID [2022-04-15 06:54:23,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-15 06:54:23,074 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:54:23,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56179975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:23,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:23,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:23,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [718976589] [2022-04-15 06:54:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [718976589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:23,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:23,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:54:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497145482] [2022-04-15 06:54:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:23,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,322 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:54:23,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:54:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:54:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:54:23,323 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,677 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:54:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:54:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-15 06:54:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-15 06:54:23,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-15 06:54:23,708 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:54:23,708 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:54:23,708 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:54:23,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:54:23,709 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:23,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:54:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:54:23,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:23,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,740 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,740 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,741 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 06:54:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:54:23,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:54:23,742 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:54:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:23,742 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 06:54:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:54:23,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:23,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:23,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:23,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 06:54:23,743 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 06:54:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:23,743 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 06:54:23,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:54:23,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 06:54:23,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:54:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:54:23,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:23,781 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:23,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:23,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:23,998 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1352532284, now seen corresponding path program 5 times [2022-04-15 06:54:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:23,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480768969] [2022-04-15 06:54:28,068 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:28,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:28,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:28,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash 211865519, now seen corresponding path program 1 times [2022-04-15 06:54:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:28,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970120526] [2022-04-15 06:54:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:28,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-15 06:54:28,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-15 06:54:28,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-15 06:54:28,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:28,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-15 06:54:28,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-15 06:54:28,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-15 06:54:28,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-15 06:54:28,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1515#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:28,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {1515#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:28,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:28,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {1516#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1517#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:54:28,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {1517#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:28,500 INFO L272 TraceCheckUtils]: 10: Hoare triple {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:28,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {1519#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:28,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1511#false} is VALID [2022-04-15 06:54:28,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-15 06:54:28,501 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:54:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:28,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970120526] [2022-04-15 06:54:28,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970120526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:28,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593283906] [2022-04-15 06:54:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:28,503 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:54:28,504 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:54:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:28,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:28,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1510#true} is VALID [2022-04-15 06:54:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-15 06:54:28,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-15 06:54:28,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-15 06:54:28,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-15 06:54:28,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1540#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:28,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#(and (<= main_~x~0 0) (= main_~y~0 500000))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:28,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:28,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {1544#(and (= main_~y~0 500000) (< main_~x~0 500001))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1551#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:28,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1551#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1555#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:28,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {1555#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:28,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:28,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1511#false} is VALID [2022-04-15 06:54:28,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-15 06:54:28,896 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:54:28,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:29,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-04-15 06:54:29,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1511#false} is VALID [2022-04-15 06:54:29,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:29,158 INFO L272 TraceCheckUtils]: 10: Hoare triple {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:29,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {1582#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [64] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1518#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:29,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [67] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_105)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52))) (or (and .cse0 (= v_main_~x~0_105 v_main_~x~0_104)) (let ((.cse1 (+ v_main_~x~0_105 v_main_~y~0_52))) (and (= .cse1 (+ v_main_~x~0_104 v_main_~y~0_53)) (< v_main_~y~0_53 v_main_~y~0_52) (< .cse1 (+ v_main_~y~0_53 1000001)) .cse2)) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not (< v_main_~x~0_105 1000000))) .cse0))) InVars {main_~x~0=v_main_~x~0_105, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_104, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1582#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:29,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [66] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:29,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [65] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (<= 500000 v_main_~x~0_103) .cse0) (and (< v_main_~x~0_103 v_main_~x~0_102) (< v_main_~x~0_102 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_102} AuxVars[] AssignedVars[main_~x~0] {1586#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:29,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} ~x~0 := 0;~y~0 := 500000; {1593#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:29,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1510#true} call #t~ret4 := main(); {1510#true} is VALID [2022-04-15 06:54:29,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1510#true} {1510#true} #41#return; {1510#true} is VALID [2022-04-15 06:54:29,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume true; {1510#true} is VALID [2022-04-15 06:54:29,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1510#true} is VALID [2022-04-15 06:54:29,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1510#true} call ULTIMATE.init(); {1510#true} is VALID [2022-04-15 06:54:29,161 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:54:29,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593283906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:29,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:29,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:29,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:29,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480768969] [2022-04-15 06:54:29,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480768969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:29,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:29,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:54:29,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145305315] [2022-04-15 06:54:29,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:54:29,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:29,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,347 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:54:29,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:54:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:54:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:54:29,348 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:29,692 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 06:54:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:54:29,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:54:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 06:54:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 06:54:29,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-15 06:54:29,750 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:54:29,750 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:54:29,750 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:54:29,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:54:29,751 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:29,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:54:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:54:29,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:29,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,807 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,808 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:29,808 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:54:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:54:29,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:29,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:29,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:54:29,809 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:54:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:29,809 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:54:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:54:29,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:29,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:29,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:29,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 06:54:29,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-04-15 06:54:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:29,810 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 06:54:29,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 06:54:29,857 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:54:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:54:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:54:29,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:29,858 INFO L499 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:29,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:30,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:30,058 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1827998623, now seen corresponding path program 6 times [2022-04-15 06:54:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113052356] [2022-04-15 06:54:34,121 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:34,170 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:34,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:34,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2033569617, now seen corresponding path program 1 times [2022-04-15 06:54:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:34,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276517830] [2022-04-15 06:54:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:34,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-15 06:54:34,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-15 06:54:34,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-15 06:54:34,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:34,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-15 06:54:34,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-15 06:54:34,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-15 06:54:34,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-15 06:54:34,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1830#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:34,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1830#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:34,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:34,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1831#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1832#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:34,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1832#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:34,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1834#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:34,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1835#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:34,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1826#false} is VALID [2022-04-15 06:54:34,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-15 06:54:34,487 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:54:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276517830] [2022-04-15 06:54:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276517830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:34,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104111547] [2022-04-15 06:54:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:34,499 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:54:34,500 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:54:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:34,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:34,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:34,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-15 06:54:34,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-15 06:54:34,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-15 06:54:34,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-15 06:54:34,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-15 06:54:34,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1855#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:34,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#(and (<= main_~x~0 0) (= main_~y~0 500000))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:34,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:34,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {1859#(and (= main_~y~0 500000) (< main_~x~0 500001))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1866#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:34,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {1866#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1870#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:34,954 INFO L272 TraceCheckUtils]: 10: Hoare triple {1870#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:34,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:34,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {1878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-15 06:54:34,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-15 06:54:34,955 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:54:34,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:35,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-15 06:54:35,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-15 06:54:35,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:35,303 INFO L272 TraceCheckUtils]: 10: Hoare triple {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {1874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:35,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {1897#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [68] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1833#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:35,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [71] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse1 (= v_main_~y~0_67 v_main_~y~0_66)) (.cse2 (<= 500000 v_main_~x~0_129))) (or (and .cse0 .cse1) (and (or (not (< v_main_~x~0_129 1000000)) (not .cse2)) .cse0 .cse1) (and (< v_main_~x~0_128 1000001) .cse2 (= (+ v_main_~x~0_128 v_main_~y~0_67) (+ v_main_~x~0_129 v_main_~y~0_66)) (< v_main_~x~0_129 v_main_~x~0_128)))) InVars {main_~x~0=v_main_~x~0_129, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_128, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1897#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:35,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [70] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:35,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {1908#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [69] L11-2-->L10-2_primed: Formula: (or (and (<= 500000 v_main_~x~0_127) (= v_main_~x~0_126 v_main_~x~0_127)) (= v_main_~x~0_127 v_main_~x~0_126) (and (< v_main_~x~0_126 500001) (< v_main_~x~0_127 v_main_~x~0_126))) InVars {main_~x~0=v_main_~x~0_127} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[main_~x~0] {1901#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:35,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} ~x~0 := 0;~y~0 := 500000; {1908#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:35,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret4 := main(); {1825#true} is VALID [2022-04-15 06:54:35,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #41#return; {1825#true} is VALID [2022-04-15 06:54:35,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-15 06:54:35,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1825#true} is VALID [2022-04-15 06:54:35,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-15 06:54:35,311 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:54:35,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104111547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:35,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:35,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:35,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113052356] [2022-04-15 06:54:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113052356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:35,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:35,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:54:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066725752] [2022-04-15 06:54:35,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:35,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:54:35,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:35,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:35,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:35,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:54:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:54:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:54:35,652 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:36,231 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 06:54:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:54:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:54:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:54:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:54:36,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-15 06:54:36,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:36,267 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:54:36,267 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:54:36,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:54:36,268 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:36,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:54:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 06:54:36,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:36,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,316 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,316 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:36,317 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 06:54:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 06:54:36,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:36,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:36,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:54:36,318 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:54:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:36,318 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 06:54:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 06:54:36,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:36,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:36,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:36,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 06:54:36,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2022-04-15 06:54:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:36,319 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 06:54:36,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:36,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 06:54:36,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 06:54:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:54:36,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:36,347 INFO L499 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:36,364 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:54:36,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:36,548 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 301485498, now seen corresponding path program 7 times [2022-04-15 06:54:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919699456] [2022-04-15 06:54:36,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:40,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:40,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:40,873 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 15962543, now seen corresponding path program 1 times [2022-04-15 06:54:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:40,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395112112] [2022-04-15 06:54:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:40,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {2166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 06:54:40,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 06:54:40,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-15 06:54:40,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:40,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {2166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 06:54:40,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 06:54:40,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-15 06:54:40,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-15 06:54:40,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2160#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:40,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:40,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:40,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {2161#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2162#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:40,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:40,959 INFO L272 TraceCheckUtils]: 10: Hoare triple {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:40,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2165#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:40,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2165#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 06:54:40,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 06:54:40,960 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:54:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395112112] [2022-04-15 06:54:40,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395112112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511470672] [2022-04-15 06:54:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:40,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:40,961 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:54:40,962 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:54:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:40,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:41,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:41,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 06:54:41,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 06:54:41,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 06:54:41,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-15 06:54:41,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-15 06:54:41,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2185#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:41,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {2185#(and (<= main_~x~0 0) (= main_~y~0 500000))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:41,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:41,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {2189#(and (= main_~y~0 500000) (< main_~x~0 500001))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2196#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:41,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2200#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:41,379 INFO L272 TraceCheckUtils]: 10: Hoare triple {2200#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:41,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:41,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {2208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 06:54:41,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 06:54:41,380 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:54:41,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:41,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 06:54:41,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {2208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 06:54:41,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:41,709 INFO L272 TraceCheckUtils]: 10: Hoare triple {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:41,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {2227#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [72] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2163#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:41,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [75] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_154)) (.cse1 (= v_main_~x~0_154 v_main_~x~0_153)) (.cse2 (= v_main_~y~0_82 v_main_~y~0_81))) (or (and .cse0 (< v_main_~x~0_154 v_main_~x~0_153) (< v_main_~x~0_153 1000001) (= (+ v_main_~x~0_154 v_main_~y~0_81) (+ v_main_~x~0_153 v_main_~y~0_82))) (and .cse1 .cse2) (and (or (not .cse0) (not (< v_main_~x~0_154 1000000))) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_154, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_153, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2227#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:41,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [74] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:41,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2238#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [73] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_152 v_main_~x~0_151) (< v_main_~x~0_151 500001)) (and (<= 500000 v_main_~x~0_152) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_152} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[main_~x~0] {2231#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:41,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~x~0 := 0;~y~0 := 500000; {2238#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:41,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret4 := main(); {2155#true} is VALID [2022-04-15 06:54:41,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #41#return; {2155#true} is VALID [2022-04-15 06:54:41,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 06:54:41,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 06:54:41,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 06:54:41,713 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:54:41,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511470672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:41,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:41,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:42,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919699456] [2022-04-15 06:54:42,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919699456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:42,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:42,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:54:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339798030] [2022-04-15 06:54:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:42,049 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:42,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,069 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:54:42,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:54:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:54:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:54:42,070 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,730 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 06:54:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:54:42,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-15 06:54:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-15 06:54:42,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-15 06:54:42,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:42,767 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:54:42,767 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:54:42,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:54:42,768 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:42,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:54:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:54:42,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:42,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:42,825 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:42,825 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,826 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 06:54:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 06:54:42,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:42,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:42,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:54:42,827 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:54:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:42,827 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 06:54:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 06:54:42,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:42,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:42,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:42,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 06:54:42,828 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-15 06:54:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:42,828 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 06:54:42,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:54:42,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 06:54:42,859 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:54:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 06:54:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:54:42,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:42,860 INFO L499 BasicCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:42,877 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:54:43,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:43,060 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2093779691, now seen corresponding path program 8 times [2022-04-15 06:54:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:43,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498054154] [2022-04-15 06:54:45,205 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:45,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:45,413 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2065494703, now seen corresponding path program 1 times [2022-04-15 06:54:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:45,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879211736] [2022-04-15 06:54:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {2511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-15 06:54:45,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-15 06:54:45,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-15 06:54:45,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:45,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {2511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-15 06:54:45,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-15 06:54:45,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-15 06:54:45,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-15 06:54:45,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2505#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:45,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {2505#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:45,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:45,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2506#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2507#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:45,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {2507#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:54:45,553 INFO L272 TraceCheckUtils]: 10: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2509#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:45,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {2509#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2510#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:45,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {2510#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2501#false} is VALID [2022-04-15 06:54:45,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-15 06:54:45,555 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:54:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879211736] [2022-04-15 06:54:45,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879211736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337036259] [2022-04-15 06:54:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:45,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:45,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:45,556 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:54:45,557 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:54:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:45,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2500#true} is VALID [2022-04-15 06:54:45,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-15 06:54:45,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-15 06:54:45,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-15 06:54:45,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-15 06:54:45,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2530#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:45,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {2530#(and (<= main_~x~0 0) (= main_~y~0 500000))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:45,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:45,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {2534#(and (= main_~y~0 500000) (< main_~x~0 500001))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2541#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:45,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {2541#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2545#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:45,877 INFO L272 TraceCheckUtils]: 10: Hoare triple {2545#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:45,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:45,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {2553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2501#false} is VALID [2022-04-15 06:54:45,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-15 06:54:45,877 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:54:45,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:46,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {2501#false} assume !false; {2501#false} is VALID [2022-04-15 06:54:46,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {2553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2501#false} is VALID [2022-04-15 06:54:46,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:46,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:46,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [76] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2508#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:54:46,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [79] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_180)) (.cse1 (= v_main_~x~0_180 v_main_~x~0_179)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97))) (or (and (< v_main_~x~0_180 v_main_~x~0_179) (= (+ v_main_~x~0_179 v_main_~y~0_98) (+ v_main_~x~0_180 v_main_~y~0_97)) (< v_main_~x~0_179 1000001) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_180 1000000)) (not .cse0))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_180, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_179, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2572#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:46,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [78] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:46,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {2583#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [77] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177))) (or .cse0 (and (<= 500000 v_main_~x~0_178) .cse0) (and (< v_main_~x~0_177 500001) (< v_main_~x~0_178 v_main_~x~0_177)))) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_177} AuxVars[] AssignedVars[main_~x~0] {2576#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:46,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {2500#true} ~x~0 := 0;~y~0 := 500000; {2583#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:54:46,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {2500#true} call #t~ret4 := main(); {2500#true} is VALID [2022-04-15 06:54:46,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2500#true} {2500#true} #41#return; {2500#true} is VALID [2022-04-15 06:54:46,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {2500#true} assume true; {2500#true} is VALID [2022-04-15 06:54:46,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2500#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2500#true} is VALID [2022-04-15 06:54:46,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {2500#true} call ULTIMATE.init(); {2500#true} is VALID [2022-04-15 06:54:46,197 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:54:46,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337036259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:46,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:46,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:46,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:46,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498054154] [2022-04-15 06:54:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498054154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:46,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:46,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:54:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690052649] [2022-04-15 06:54:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:54:46,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:46,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:46,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:46,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:54:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:54:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:54:46,599 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:47,210 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 06:54:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:54:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:54:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-15 06:54:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-15 06:54:47,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-04-15 06:54:47,243 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:54:47,244 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:54:47,245 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:54:47,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:54:47,246 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:47,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 78 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:54:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:54:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 06:54:47,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:47,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,299 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,299 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:47,304 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 06:54:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 06:54:47,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:47,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:47,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:54:47,305 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:54:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:47,309 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 06:54:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 06:54:47,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:47,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:47,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:47,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 06:54:47,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2022-04-15 06:54:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:47,311 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 06:54:47,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:47,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 06:54:47,332 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:54:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 06:54:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:54:47,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:47,335 INFO L499 BasicCegarLoop]: trace histogram [11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:47,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:47,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 06:54:47,551 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1841155664, now seen corresponding path program 9 times [2022-04-15 06:54:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:47,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625434948] [2022-04-15 06:54:48,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:48,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:48,521 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash -179940433, now seen corresponding path program 1 times [2022-04-15 06:54:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:48,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800089717] [2022-04-15 06:54:48,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:48,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-15 06:54:48,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-15 06:54:48,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-15 06:54:48,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:48,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {2871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-15 06:54:48,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-15 06:54:48,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-15 06:54:48,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-15 06:54:48,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2865#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:48,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {2865#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:48,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:48,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {2866#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2867#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:54:48,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:48,628 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:48,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {2869#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2870#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:48,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {2870#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2861#false} is VALID [2022-04-15 06:54:48,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-15 06:54:48,628 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:54:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800089717] [2022-04-15 06:54:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800089717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162774931] [2022-04-15 06:54:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:48,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:48,634 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:54:48,639 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:54:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:48,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:48,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:48,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2022-04-15 06:54:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-15 06:54:48,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-15 06:54:48,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-15 06:54:48,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-15 06:54:48,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2890#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:48,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {2890#(and (<= main_~x~0 0) (= main_~y~0 500000))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:48,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:48,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2894#(and (= main_~y~0 500000) (< main_~x~0 500001))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2901#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:48,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2901#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2905#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:48,916 INFO L272 TraceCheckUtils]: 10: Hoare triple {2905#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:48,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:48,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2861#false} is VALID [2022-04-15 06:54:48,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-15 06:54:48,917 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:54:48,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:49,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#false} assume !false; {2861#false} is VALID [2022-04-15 06:54:49,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {2913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2861#false} is VALID [2022-04-15 06:54:49,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:49,231 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {2909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:49,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [80] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2868#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:49,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [83] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_207 v_main_~x~0_206)) (.cse1 (= v_main_~y~0_115 v_main_~y~0_114)) (.cse2 (<= 500000 v_main_~x~0_207))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_207 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_207 v_main_~y~0_114))) (and (= .cse3 (+ v_main_~x~0_206 v_main_~y~0_115)) .cse2 (< v_main_~y~0_115 v_main_~y~0_114) (< .cse3 (+ v_main_~y~0_115 1000001)))))) InVars {main_~x~0=v_main_~x~0_207, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2932#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:49,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [82] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:49,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {2943#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [81] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_205 v_main_~x~0_204))) (or (and (< v_main_~x~0_205 v_main_~x~0_204) (< v_main_~x~0_204 500001)) (and (<= 500000 v_main_~x~0_205) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_205} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[main_~x~0] {2936#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:49,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2860#true} ~x~0 := 0;~y~0 := 500000; {2943#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:49,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2860#true} call #t~ret4 := main(); {2860#true} is VALID [2022-04-15 06:54:49,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2860#true} {2860#true} #41#return; {2860#true} is VALID [2022-04-15 06:54:49,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {2860#true} assume true; {2860#true} is VALID [2022-04-15 06:54:49,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {2860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2860#true} is VALID [2022-04-15 06:54:49,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2860#true} call ULTIMATE.init(); {2860#true} is VALID [2022-04-15 06:54:49,234 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:54:49,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162774931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:49,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:49,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:49,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625434948] [2022-04-15 06:54:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625434948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:49,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:49,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:54:49,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826719255] [2022-04-15 06:54:49,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:49,607 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:54:49,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:49,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:49,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:49,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:54:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:54:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:54:49,632 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,506 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 06:54:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:54:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:54:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-15 06:54:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-15 06:54:50,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-15 06:54:50,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,546 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:54:50,546 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:54:50,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1340, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:54:50,547 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:50,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:54:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 06:54:50,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:50,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,616 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,616 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,617 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-15 06:54:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 06:54:50,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 06:54:50,617 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 06:54:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,618 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-15 06:54:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 06:54:50,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:50,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-15 06:54:50,618 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2022-04-15 06:54:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:50,619 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-15 06:54:50,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-15 06:54:50,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 06:54:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:54:50,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:50,654 INFO L499 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:50,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 06:54:50,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:50,855 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 412365707, now seen corresponding path program 10 times [2022-04-15 06:54:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:50,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426695679] [2022-04-15 06:54:50,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:55,065 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:55,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:55,176 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1869591727, now seen corresponding path program 1 times [2022-04-15 06:54:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046932226] [2022-04-15 06:54:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:55,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {3246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-15 06:54:55,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-15 06:54:55,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-15 06:54:55,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:55,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-15 06:54:55,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-15 06:54:55,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-15 06:54:55,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-15 06:54:55,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3240#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:55,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {3240#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:55,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:55,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {3241#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3242#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:54:55,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {3242#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:55,306 INFO L272 TraceCheckUtils]: 10: Hoare triple {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:55,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3245#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:55,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3236#false} is VALID [2022-04-15 06:54:55,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-15 06:54:55,307 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:54:55,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046932226] [2022-04-15 06:54:55,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046932226] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763510156] [2022-04-15 06:54:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:55,308 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:54:55,310 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:54:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:55,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:55,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:55,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3235#true} is VALID [2022-04-15 06:54:55,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-15 06:54:55,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-15 06:54:55,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-15 06:54:55,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-15 06:54:55,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3265#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:55,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {3265#(and (<= main_~x~0 0) (= main_~y~0 500000))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:55,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:55,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {3269#(and (= main_~y~0 500000) (< main_~x~0 500001))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3276#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:55,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {3276#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3280#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:55,737 INFO L272 TraceCheckUtils]: 10: Hoare triple {3280#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:55,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:55,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3236#false} is VALID [2022-04-15 06:54:55,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-15 06:54:55,737 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:54:55,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:55,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#false} assume !false; {3236#false} is VALID [2022-04-15 06:54:55,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3236#false} is VALID [2022-04-15 06:54:55,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:55,950 INFO L272 TraceCheckUtils]: 10: Hoare triple {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:55,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {3307#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [84] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3243#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:55,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [87] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_235)) (.cse2 (= v_main_~x~0_235 v_main_~x~0_234)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132))) (or (let ((.cse1 (+ v_main_~x~0_235 v_main_~y~0_132))) (and (< v_main_~y~0_133 v_main_~y~0_132) .cse0 (= .cse1 (+ v_main_~x~0_234 v_main_~y~0_133)) (< .cse1 (+ v_main_~y~0_133 1000001)))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_235 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_133} OutVars{main_~x~0=v_main_~x~0_234, main_~y~0=v_main_~y~0_132} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3307#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:55,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [86] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:55,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {3318#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [85] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232))) (or .cse0 (and (< v_main_~x~0_232 500001) (< v_main_~x~0_233 v_main_~x~0_232)) (and .cse0 (not (< v_main_~x~0_233 500000))))) InVars {main_~x~0=v_main_~x~0_233} OutVars{main_~x~0=v_main_~x~0_232} AuxVars[] AssignedVars[main_~x~0] {3311#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:55,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {3235#true} ~x~0 := 0;~y~0 := 500000; {3318#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:55,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {3235#true} call #t~ret4 := main(); {3235#true} is VALID [2022-04-15 06:54:55,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3235#true} {3235#true} #41#return; {3235#true} is VALID [2022-04-15 06:54:55,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {3235#true} assume true; {3235#true} is VALID [2022-04-15 06:54:55,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {3235#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3235#true} is VALID [2022-04-15 06:54:55,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {3235#true} call ULTIMATE.init(); {3235#true} is VALID [2022-04-15 06:54:55,953 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:54:55,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763510156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:55,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:54:56,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:56,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426695679] [2022-04-15 06:54:56,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426695679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:56,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:56,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:54:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619071293] [2022-04-15 06:54:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:56,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:56,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:56,248 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:54:56,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:54:56,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:54:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:54:56,249 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:57,020 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 06:54:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:54:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-15 06:54:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-15 06:54:57,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2022-04-15 06:54:57,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:57,060 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:54:57,060 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:54:57,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:54:57,061 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:57,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 63 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:54:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:54:57,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:57,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:57,136 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:57,136 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:57,136 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 06:54:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:54:57,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:57,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:57,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:54:57,137 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:54:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:57,137 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 06:54:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:54:57,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:57,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:57,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:57,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-15 06:54:57,138 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2022-04-15 06:54:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:57,138 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-15 06:54:57,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 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:54:57,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 42 transitions. [2022-04-15 06:54:57,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:54:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:54:57,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:57,178 INFO L499 BasicCegarLoop]: trace histogram [13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:57,194 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:54:57,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:54:57,378 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1382886054, now seen corresponding path program 11 times [2022-04-15 06:54:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:57,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981819350] [2022-04-15 06:54:57,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:57,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:57,679 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -375843409, now seen corresponding path program 1 times [2022-04-15 06:54:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628646672] [2022-04-15 06:54:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:57,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {3636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-15 06:54:57,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-15 06:54:57,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-15 06:54:57,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:57,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {3636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-15 06:54:57,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-15 06:54:57,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-15 06:54:57,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-15 06:54:57,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3630#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:54:57,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {3630#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:57,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:54:57,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {3631#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:57,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:57,787 INFO L272 TraceCheckUtils]: 10: Hoare triple {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3634#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:57,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {3634#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3635#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:57,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {3635#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3626#false} is VALID [2022-04-15 06:54:57,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-15 06:54:57,788 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:54:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:57,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628646672] [2022-04-15 06:54:57,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628646672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:57,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830195269] [2022-04-15 06:54:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:57,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:57,789 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:54:57,790 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:54:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:57,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:57,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:58,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3625#true} is VALID [2022-04-15 06:54:58,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-15 06:54:58,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-15 06:54:58,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-15 06:54:58,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-15 06:54:58,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3655#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:54:58,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {3655#(and (<= main_~x~0 0) (= main_~y~0 500000))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:58,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:58,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {3659#(and (= main_~y~0 500000) (< main_~x~0 500001))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3666#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:58,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {3666#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3670#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:58,220 INFO L272 TraceCheckUtils]: 10: Hoare triple {3670#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:58,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:58,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3626#false} is VALID [2022-04-15 06:54:58,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-15 06:54:58,221 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:54:58,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:58,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {3626#false} assume !false; {3626#false} is VALID [2022-04-15 06:54:58,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3626#false} is VALID [2022-04-15 06:54:58,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3678#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:54:58,549 INFO L272 TraceCheckUtils]: 10: Hoare triple {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {3674#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:58,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [88] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3633#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:54:58,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [91] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_264)) (.cse0 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse1 (= v_main_~x~0_264 v_main_~x~0_263))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_264 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_264 v_main_~y~0_151))) (and (= (+ v_main_~x~0_263 v_main_~y~0_152) .cse3) (< .cse3 (+ v_main_~y~0_152 1000001)) .cse2 (< v_main_~y~0_152 v_main_~y~0_151))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_264, main_~y~0=v_main_~y~0_152} OutVars{main_~x~0=v_main_~x~0_263, main_~y~0=v_main_~y~0_151} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3632#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:58,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [90] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:58,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {3707#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [89] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_262 v_main_~x~0_261))) (or (and .cse0 (<= 500000 v_main_~x~0_262)) (and (< v_main_~x~0_262 v_main_~x~0_261) (< v_main_~x~0_261 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_262} OutVars{main_~x~0=v_main_~x~0_261} AuxVars[] AssignedVars[main_~x~0] {3700#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:58,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {3625#true} ~x~0 := 0;~y~0 := 500000; {3707#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:54:58,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {3625#true} call #t~ret4 := main(); {3625#true} is VALID [2022-04-15 06:54:58,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3625#true} {3625#true} #41#return; {3625#true} is VALID [2022-04-15 06:54:58,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {3625#true} assume true; {3625#true} is VALID [2022-04-15 06:54:58,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {3625#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3625#true} is VALID [2022-04-15 06:54:58,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {3625#true} call ULTIMATE.init(); {3625#true} is VALID [2022-04-15 06:54:58,553 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:54:58,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830195269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:58,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:58,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 06:54:59,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:59,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981819350] [2022-04-15 06:54:59,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981819350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:59,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:59,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:54:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739691843] [2022-04-15 06:54:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:54:59,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:59,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:59,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:59,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:54:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:54:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:54:59,064 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:00,082 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 06:55:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:55:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:55:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-15 06:55:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-15 06:55:00,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-15 06:55:00,125 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:55:00,126 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:55:00,126 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:55:00,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:55:00,127 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:00,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 63 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:55:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:55:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 06:55:00,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:00,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,211 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,211 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:00,212 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 06:55:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 06:55:00,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:00,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:00,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:55:00,212 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:55:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:00,213 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 06:55:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 06:55:00,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:00,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:00,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:00,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-15 06:55:00,214 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2022-04-15 06:55:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:00,214 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-15 06:55:00,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:00,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-15 06:55:00,243 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:55:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 06:55:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:55:00,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:00,244 INFO L499 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:00,262 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:55:00,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:55:00,460 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2045036289, now seen corresponding path program 12 times [2022-04-15 06:55:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630828604] [2022-04-15 06:55:04,519 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:04,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:04,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:04,803 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688751, now seen corresponding path program 1 times [2022-04-15 06:55:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044944884] [2022-04-15 06:55:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:04,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {4040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-15 06:55:04,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-15 06:55:04,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-15 06:55:04,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:04,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {4040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-15 06:55:04,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-15 06:55:04,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-15 06:55:04,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-15 06:55:04,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4034#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:04,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {4034#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:04,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:04,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {4035#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4036#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:04,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {4036#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:04,889 INFO L272 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:04,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {4038#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4039#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:04,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {4039#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4030#false} is VALID [2022-04-15 06:55:04,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-15 06:55:04,889 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:55:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:04,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044944884] [2022-04-15 06:55:04,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044944884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:04,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412897940] [2022-04-15 06:55:04,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:04,891 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:55:04,891 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:55:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:04,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:04,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:05,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-15 06:55:05,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-15 06:55:05,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-15 06:55:05,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-15 06:55:05,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-15 06:55:05,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4059#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:05,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {4059#(and (<= main_~x~0 0) (= main_~y~0 500000))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:05,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:05,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {4063#(and (= main_~y~0 500000) (< main_~x~0 500001))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4070#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:05,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {4070#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4074#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:05,298 INFO L272 TraceCheckUtils]: 10: Hoare triple {4074#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:05,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:05,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-15 06:55:05,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-15 06:55:05,299 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:55:05,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:05,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-15 06:55:05,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-15 06:55:05,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:05,646 INFO L272 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:05,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {4101#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [92] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4037#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:05,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [95] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1) (and (< v_main_~x~0_293 1000001) .cse2 (= (+ v_main_~x~0_294 v_main_~y~0_171) (+ v_main_~x~0_293 v_main_~y~0_172)) (< v_main_~x~0_294 v_main_~x~0_293)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_172} OutVars{main_~x~0=v_main_~x~0_293, main_~y~0=v_main_~y~0_171} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4101#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:05,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [94] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:05,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {4112#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [93] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291))) (or (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_292)))) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[main_~x~0] {4105#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:05,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} ~x~0 := 0;~y~0 := 500000; {4112#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:05,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret4 := main(); {4029#true} is VALID [2022-04-15 06:55:05,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #41#return; {4029#true} is VALID [2022-04-15 06:55:05,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-15 06:55:05,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-15 06:55:05,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-15 06:55:05,650 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:55:05,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412897940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:05,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:05,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:06,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630828604] [2022-04-15 06:55:06,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630828604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:06,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:06,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:55:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141804557] [2022-04-15 06:55:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:55:06,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:06,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:06,192 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:55:06,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:55:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:55:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:55:06,193 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:07,190 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-15 06:55:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:55:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:55:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-15 06:55:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-15 06:55:07,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-15 06:55:07,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:07,228 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:55:07,228 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:55:07,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:55:07,231 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:07,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:55:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:55:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 06:55:07,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:07,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,286 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,286 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:07,295 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 06:55:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 06:55:07,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:07,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:07,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:55:07,296 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:55:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:07,297 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 06:55:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 06:55:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:07,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:07,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:07,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-15 06:55:07,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 39 [2022-04-15 06:55:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:07,298 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-15 06:55:07,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 18 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:07,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-15 06:55:07,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 06:55:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:55:07,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:07,327 INFO L499 BasicCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:07,346 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:55:07,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:55:07,540 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1578714980, now seen corresponding path program 13 times [2022-04-15 06:55:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262928450] [2022-04-15 06:55:07,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:07,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:07,827 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash -571746385, now seen corresponding path program 1 times [2022-04-15 06:55:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:07,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379180025] [2022-04-15 06:55:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {4460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:07,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-15 06:55:07,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-15 06:55:07,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4454#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:07,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {4454#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:07,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:07,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {4455#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4456#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:07,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {4456#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:07,949 INFO L272 TraceCheckUtils]: 10: Hoare triple {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4458#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:07,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4459#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:07,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {4459#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4450#false} is VALID [2022-04-15 06:55:07,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-15 06:55:07,949 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:55:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:07,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379180025] [2022-04-15 06:55:07,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379180025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417862163] [2022-04-15 06:55:07,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:07,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:07,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:07,950 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:55:07,951 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:55:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:07,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:08,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2022-04-15 06:55:08,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-15 06:55:08,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-15 06:55:08,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-15 06:55:08,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-15 06:55:08,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4479#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:08,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {4479#(and (<= main_~x~0 0) (= main_~y~0 500000))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:08,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:08,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {4483#(and (= main_~y~0 500000) (< main_~x~0 500001))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4490#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:08,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {4490#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4494#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:08,407 INFO L272 TraceCheckUtils]: 10: Hoare triple {4494#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:08,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:08,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {4502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4450#false} is VALID [2022-04-15 06:55:08,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-15 06:55:08,408 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:55:08,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:08,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2022-04-15 06:55:08,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {4502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4450#false} is VALID [2022-04-15 06:55:08,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:08,726 INFO L272 TraceCheckUtils]: 10: Hoare triple {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:08,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {4521#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [96] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4457#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:08,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [99] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse0 (<= 500000 v_main_~x~0_325))) (or (and (< v_main_~x~0_324 1000001) (< v_main_~x~0_325 v_main_~x~0_324) .cse0 (= (+ v_main_~x~0_325 v_main_~y~0_192) (+ v_main_~x~0_324 v_main_~y~0_193))) (and .cse1 (= v_main_~x~0_325 v_main_~x~0_324)) (and .cse1 (= v_main_~x~0_324 v_main_~x~0_325) (or (not .cse0) (not (< v_main_~x~0_325 1000000)))))) InVars {main_~x~0=v_main_~x~0_325, main_~y~0=v_main_~y~0_193} OutVars{main_~x~0=v_main_~x~0_324, main_~y~0=v_main_~y~0_192} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4521#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:08,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [98] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:08,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {4532#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [97] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_323 v_main_~x~0_322))) (or .cse0 (and (< v_main_~x~0_322 500001) (< v_main_~x~0_323 v_main_~x~0_322)) (and .cse0 (<= 500000 v_main_~x~0_323)))) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[main_~x~0] {4525#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:08,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 500000; {4532#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:08,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {4449#true} call #t~ret4 := main(); {4449#true} is VALID [2022-04-15 06:55:08,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4449#true} {4449#true} #41#return; {4449#true} is VALID [2022-04-15 06:55:08,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {4449#true} assume true; {4449#true} is VALID [2022-04-15 06:55:08,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {4449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4449#true} is VALID [2022-04-15 06:55:08,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2022-04-15 06:55:08,729 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:55:08,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417862163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:08,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:08,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:09,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:09,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262928450] [2022-04-15 06:55:09,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262928450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:09,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:09,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:55:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149629378] [2022-04-15 06:55:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:09,255 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:09,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:09,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:09,286 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:55:09,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:55:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:09,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:55:09,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:55:09,287 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:10,691 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 06:55:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:55:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-15 06:55:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-15 06:55:10,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 57 transitions. [2022-04-15 06:55:10,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:10,723 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:55:10,723 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:55:10,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:55:10,724 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:10,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:55:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 06:55:10,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:10,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:10,784 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:10,784 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:10,784 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-15 06:55:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-15 06:55:10,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:10,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:10,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:55:10,785 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:55:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:10,785 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-15 06:55:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-15 06:55:10,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:10,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:10,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:10,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-15 06:55:10,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2022-04-15 06:55:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:10,787 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-15 06:55:10,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 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:55:10,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2022-04-15 06:55:10,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-15 06:55:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:55:10,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:10,816 INFO L499 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:10,832 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:55:11,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:55:11,032 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -785207433, now seen corresponding path program 14 times [2022-04-15 06:55:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:11,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536361308] [2022-04-15 06:55:11,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:11,245 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:11,245 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1477785775, now seen corresponding path program 1 times [2022-04-15 06:55:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:11,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457195607] [2022-04-15 06:55:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {4895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-15 06:55:11,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 06:55:11,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-15 06:55:11,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:11,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-15 06:55:11,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 06:55:11,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-15 06:55:11,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-15 06:55:11,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4889#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:11,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {4889#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:11,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:11,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {4890#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4891#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:11,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4891#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:11,382 INFO L272 TraceCheckUtils]: 10: Hoare triple {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:11,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {4893#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4894#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:11,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {4894#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 06:55:11,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 06:55:11,384 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:55:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457195607] [2022-04-15 06:55:11,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457195607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:11,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743612817] [2022-04-15 06:55:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:11,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:11,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:11,385 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:55:11,389 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:55:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:11,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:11,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-15 06:55:11,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-15 06:55:11,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 06:55:11,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-15 06:55:11,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-15 06:55:11,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4914#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:11,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {4914#(and (<= main_~x~0 0) (= main_~y~0 500000))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:11,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:11,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {4918#(and (= main_~y~0 500000) (< main_~x~0 500001))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4925#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:11,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {4925#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4929#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:11,787 INFO L272 TraceCheckUtils]: 10: Hoare triple {4929#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:11,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:11,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {4937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 06:55:11,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 06:55:11,788 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:55:11,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:12,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {4885#false} assume !false; {4885#false} is VALID [2022-04-15 06:55:12,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {4937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4885#false} is VALID [2022-04-15 06:55:12,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:12,129 INFO L272 TraceCheckUtils]: 10: Hoare triple {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {4933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:12,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {4956#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [100] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:12,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [103] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_357)) (.cse1 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse2 (= v_main_~x~0_357 v_main_~x~0_356))) (or (and .cse0 (< v_main_~x~0_357 v_main_~x~0_356) (< v_main_~x~0_356 1000001) (= (+ v_main_~x~0_356 v_main_~y~0_215) (+ v_main_~x~0_357 v_main_~y~0_214))) (and .cse1 .cse2) (and (or (not (< v_main_~x~0_357 1000000)) (not .cse0)) .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_357, main_~y~0=v_main_~y~0_215} OutVars{main_~x~0=v_main_~x~0_356, main_~y~0=v_main_~y~0_214} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4956#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:12,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [102] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:12,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {4967#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [101] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_355 v_main_~x~0_354))) (or .cse0 (and (not (< v_main_~x~0_355 500000)) .cse0) (and (< v_main_~x~0_354 500001) (< v_main_~x~0_355 v_main_~x~0_354)))) InVars {main_~x~0=v_main_~x~0_355} OutVars{main_~x~0=v_main_~x~0_354} AuxVars[] AssignedVars[main_~x~0] {4960#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:12,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {4884#true} ~x~0 := 0;~y~0 := 500000; {4967#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:12,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {4884#true} call #t~ret4 := main(); {4884#true} is VALID [2022-04-15 06:55:12,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4884#true} {4884#true} #41#return; {4884#true} is VALID [2022-04-15 06:55:12,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {4884#true} assume true; {4884#true} is VALID [2022-04-15 06:55:12,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4884#true} is VALID [2022-04-15 06:55:12,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {4884#true} call ULTIMATE.init(); {4884#true} is VALID [2022-04-15 06:55:12,132 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:55:12,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743612817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:12,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:12,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:12,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:12,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536361308] [2022-04-15 06:55:12,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536361308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:12,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:12,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:55:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213850018] [2022-04-15 06:55:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:12,725 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:55:12,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:12,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:12,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:12,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:55:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:55:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:55:12,749 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:13,929 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-15 06:55:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:55:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:55:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 06:55:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-15 06:55:13,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-15 06:55:13,963 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:55:13,964 INFO L225 Difference]: With dead ends: 54 [2022-04-15 06:55:13,964 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:55:13,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=2155, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:55:13,965 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:13,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 73 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:55:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:55:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 06:55:14,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:14,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,031 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,031 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:14,031 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 06:55:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 06:55:14,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:14,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:14,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:55:14,032 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:55:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:14,033 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 06:55:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 06:55:14,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:14,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:14,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:14,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 06:55:14,034 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2022-04-15 06:55:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:14,034 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 06:55:14,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 06:55:14,064 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:55:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 06:55:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:55:14,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:14,065 INFO L499 BasicCegarLoop]: trace histogram [17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:14,081 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:55:14,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:14,281 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1566333842, now seen corresponding path program 15 times [2022-04-15 06:55:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:14,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291104193] [2022-04-15 06:55:18,357 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:18,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:18,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:18,589 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -767649361, now seen corresponding path program 1 times [2022-04-15 06:55:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647829347] [2022-04-15 06:55:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:18,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:18,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {5345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:18,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {5345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-15 06:55:18,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-15 06:55:18,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5339#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:18,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {5339#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:18,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:18,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {5340#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5341#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:18,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {5341#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:18,735 INFO L272 TraceCheckUtils]: 10: Hoare triple {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5343#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:18,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {5343#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5344#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:18,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {5344#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5335#false} is VALID [2022-04-15 06:55:18,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-15 06:55:18,736 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:55:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647829347] [2022-04-15 06:55:18,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647829347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157171291] [2022-04-15 06:55:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:18,737 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:55:18,738 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:55:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:18,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:18,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:19,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5334#true} is VALID [2022-04-15 06:55:19,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-15 06:55:19,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-15 06:55:19,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-15 06:55:19,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-15 06:55:19,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5364#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:19,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {5364#(and (<= main_~x~0 0) (= main_~y~0 500000))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:19,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:19,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#(and (= main_~y~0 500000) (< main_~x~0 500001))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5375#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:19,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {5375#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:19,098 INFO L272 TraceCheckUtils]: 10: Hoare triple {5379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:19,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:19,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5335#false} is VALID [2022-04-15 06:55:19,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-15 06:55:19,099 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:55:19,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:19,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {5335#false} assume !false; {5335#false} is VALID [2022-04-15 06:55:19,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {5387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5335#false} is VALID [2022-04-15 06:55:19,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:19,402 INFO L272 TraceCheckUtils]: 10: Hoare triple {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:19,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {5406#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [104] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5342#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:19,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [107] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_238 v_main_~y~0_237)) (.cse1 (<= 500000 v_main_~x~0_390))) (or (let ((.cse0 (+ v_main_~x~0_390 v_main_~y~0_237))) (and (< .cse0 (+ v_main_~y~0_238 1000001)) (= (+ v_main_~x~0_389 v_main_~y~0_238) .cse0) (< v_main_~y~0_238 v_main_~y~0_237) .cse1)) (and .cse2 (= v_main_~x~0_390 v_main_~x~0_389)) (and .cse2 (= v_main_~x~0_389 v_main_~x~0_390) (or (not .cse1) (not (< v_main_~x~0_390 1000000)))))) InVars {main_~x~0=v_main_~x~0_390, main_~y~0=v_main_~y~0_238} OutVars{main_~x~0=v_main_~x~0_389, main_~y~0=v_main_~y~0_237} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5406#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:19,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [106] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:19,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {5417#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [105] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_388 v_main_~x~0_387))) (or (and .cse0 (not (< v_main_~x~0_388 500000))) .cse0 (and (< v_main_~x~0_388 v_main_~x~0_387) (< v_main_~x~0_387 500001)))) InVars {main_~x~0=v_main_~x~0_388} OutVars{main_~x~0=v_main_~x~0_387} AuxVars[] AssignedVars[main_~x~0] {5410#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:19,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {5334#true} ~x~0 := 0;~y~0 := 500000; {5417#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:19,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {5334#true} call #t~ret4 := main(); {5334#true} is VALID [2022-04-15 06:55:19,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5334#true} {5334#true} #41#return; {5334#true} is VALID [2022-04-15 06:55:19,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {5334#true} assume true; {5334#true} is VALID [2022-04-15 06:55:19,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {5334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5334#true} is VALID [2022-04-15 06:55:19,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {5334#true} call ULTIMATE.init(); {5334#true} is VALID [2022-04-15 06:55:19,406 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:55:19,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157171291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:19,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:19,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:19,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:19,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291104193] [2022-04-15 06:55:19,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291104193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:19,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:19,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:55:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264313403] [2022-04-15 06:55:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:55:19,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:19,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:20,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:20,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:55:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:55:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:55:20,016 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:21,425 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 06:55:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:55:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:55:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-15 06:55:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-15 06:55:21,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 61 transitions. [2022-04-15 06:55:21,461 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:55:21,462 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:55:21,462 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:55:21,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=414, Invalid=2342, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:55:21,466 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:21,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 113 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:55:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 06:55:21,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:21,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,552 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,552 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:21,560 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-15 06:55:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:55:21,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:21,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:21,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:55:21,560 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:55:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:21,561 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-15 06:55:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:55:21,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:21,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:21,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:21,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-04-15 06:55:21,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 45 [2022-04-15 06:55:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:21,562 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-04-15 06:55:21,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:21,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2022-04-15 06:55:21,616 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:55:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:55:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:55:21,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:21,617 INFO L499 BasicCegarLoop]: trace histogram [18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:21,633 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:55:21,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:55:21,829 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2050265875, now seen corresponding path program 16 times [2022-04-15 06:55:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:21,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387216908] [2022-04-15 06:55:21,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:26,007 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:26,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:26,124 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1281882799, now seen corresponding path program 1 times [2022-04-15 06:55:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:26,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278443642] [2022-04-15 06:55:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {5810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-15 06:55:26,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-15 06:55:26,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-15 06:55:26,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:26,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {5810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-15 06:55:26,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-15 06:55:26,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-15 06:55:26,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-15 06:55:26,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5804#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:26,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {5804#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:26,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:26,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {5805#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5806#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:55:26,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {5806#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:26,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5808#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:26,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {5808#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5809#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:26,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {5809#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5800#false} is VALID [2022-04-15 06:55:26,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-15 06:55:26,246 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:55:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278443642] [2022-04-15 06:55:26,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278443642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630256043] [2022-04-15 06:55:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:26,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:26,264 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:55:26,287 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:55:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:26,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5799#true} is VALID [2022-04-15 06:55:26,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-15 06:55:26,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-15 06:55:26,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-15 06:55:26,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-15 06:55:26,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5829#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:26,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(and (<= main_~x~0 0) (= main_~y~0 500000))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:26,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:26,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {5833#(and (= main_~y~0 500000) (< main_~x~0 500001))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5840#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:26,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5844#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:26,661 INFO L272 TraceCheckUtils]: 10: Hoare triple {5844#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:26,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:26,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {5852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5800#false} is VALID [2022-04-15 06:55:26,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-15 06:55:26,662 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:55:26,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:26,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {5800#false} assume !false; {5800#false} is VALID [2022-04-15 06:55:26,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {5852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5800#false} is VALID [2022-04-15 06:55:26,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:26,917 INFO L272 TraceCheckUtils]: 10: Hoare triple {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {5848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:26,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {5871#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [108] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {5807#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:26,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [111] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_262 v_main_~y~0_261)) (.cse2 (<= 500000 v_main_~x~0_424))) (or (and .cse0 (= v_main_~x~0_424 v_main_~x~0_423)) (let ((.cse1 (+ v_main_~x~0_424 v_main_~y~0_261))) (and (= .cse1 (+ v_main_~x~0_423 v_main_~y~0_262)) (< v_main_~y~0_262 v_main_~y~0_261) .cse2 (< .cse1 (+ v_main_~y~0_262 1000001)))) (and .cse0 (= v_main_~x~0_423 v_main_~x~0_424) (or (not (< v_main_~x~0_424 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_424, main_~y~0=v_main_~y~0_262} OutVars{main_~x~0=v_main_~x~0_423, main_~y~0=v_main_~y~0_261} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5871#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:26,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [110] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:26,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {5882#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [109] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_422 v_main_~x~0_421))) (or .cse0 (and (< v_main_~x~0_421 500001) (< v_main_~x~0_422 v_main_~x~0_421)) (and .cse0 (<= 500000 v_main_~x~0_422)))) InVars {main_~x~0=v_main_~x~0_422} OutVars{main_~x~0=v_main_~x~0_421} AuxVars[] AssignedVars[main_~x~0] {5875#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:26,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {5799#true} ~x~0 := 0;~y~0 := 500000; {5882#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:26,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {5799#true} call #t~ret4 := main(); {5799#true} is VALID [2022-04-15 06:55:26,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5799#true} {5799#true} #41#return; {5799#true} is VALID [2022-04-15 06:55:26,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {5799#true} assume true; {5799#true} is VALID [2022-04-15 06:55:26,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {5799#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5799#true} is VALID [2022-04-15 06:55:26,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {5799#true} call ULTIMATE.init(); {5799#true} is VALID [2022-04-15 06:55:26,920 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:55:26,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630256043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:26,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:26,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:27,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387216908] [2022-04-15 06:55:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387216908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:27,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:27,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:55:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861641211] [2022-04-15 06:55:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:27,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:27,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:27,580 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:55:27,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:55:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:27,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:55:27,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:55:27,582 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:29,117 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-15 06:55:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:55:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-15 06:55:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2022-04-15 06:55:29,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2022-04-15 06:55:29,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:29,159 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:55:29,159 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:55:29,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=433, Invalid=2537, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:55:29,160 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:29,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 78 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:55:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:55:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 06:55:29,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:29,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:29,282 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:29,282 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:29,283 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-15 06:55:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 06:55:29,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:29,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:29,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:55:29,284 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:55:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:29,284 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-15 06:55:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 06:55:29,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:29,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:29,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-15 06:55:29,285 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 47 [2022-04-15 06:55:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:29,285 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-15 06:55:29,285 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 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:55:29,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-15 06:55:29,333 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:55:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 06:55:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:55:29,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:29,338 INFO L499 BasicCegarLoop]: trace histogram [19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:29,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 06:55:29,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:29,538 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1320915848, now seen corresponding path program 17 times [2022-04-15 06:55:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:29,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715895833] [2022-04-15 06:55:33,602 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:33,639 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:33,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:33,845 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -963552337, now seen corresponding path program 1 times [2022-04-15 06:55:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:33,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523557766] [2022-04-15 06:55:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:33,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {6290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:33,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {6290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-15 06:55:33,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-15 06:55:33,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6284#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:33,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {6284#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:33,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:33,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {6285#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6286#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:55:33,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {6286#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:33,940 INFO L272 TraceCheckUtils]: 10: Hoare triple {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6288#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:33,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6289#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:33,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {6289#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6280#false} is VALID [2022-04-15 06:55:33,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-15 06:55:33,940 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:55:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:33,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523557766] [2022-04-15 06:55:33,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523557766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:33,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390718662] [2022-04-15 06:55:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:33,951 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:55:33,958 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:55:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:33,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:33,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:34,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6279#true} is VALID [2022-04-15 06:55:34,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-15 06:55:34,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-15 06:55:34,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-15 06:55:34,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-15 06:55:34,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6309#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:34,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {6309#(and (<= main_~x~0 0) (= main_~y~0 500000))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:34,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:34,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {6313#(and (= main_~y~0 500000) (< main_~x~0 500001))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6320#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:34,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {6320#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6324#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:34,349 INFO L272 TraceCheckUtils]: 10: Hoare triple {6324#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:34,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:34,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {6332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-04-15 06:55:34,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-15 06:55:34,350 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:55:34,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:34,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-04-15 06:55:34,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {6332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-04-15 06:55:34,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:34,677 INFO L272 TraceCheckUtils]: 10: Hoare triple {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:34,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {6351#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [112] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6287#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:34,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [115] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse3 (= v_main_~x~0_459 v_main_~x~0_458)) (.cse1 (<= 500000 v_main_~x~0_459))) (or (let ((.cse0 (+ v_main_~x~0_459 v_main_~y~0_286))) (and (= .cse0 (+ v_main_~x~0_458 v_main_~y~0_287)) .cse1 (< .cse0 (+ v_main_~y~0_287 1000001)) (< v_main_~y~0_287 v_main_~y~0_286))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_459 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_287} OutVars{main_~x~0=v_main_~x~0_458, main_~y~0=v_main_~y~0_286} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6351#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:34,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [114] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:34,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {6362#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [113] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_457 v_main_~x~0_456))) (or .cse0 (and (< v_main_~x~0_456 500001) (< v_main_~x~0_457 v_main_~x~0_456)) (and (not (< v_main_~x~0_457 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_456} AuxVars[] AssignedVars[main_~x~0] {6355#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:34,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~x~0 := 0;~y~0 := 500000; {6362#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:34,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {6279#true} call #t~ret4 := main(); {6279#true} is VALID [2022-04-15 06:55:34,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6279#true} {6279#true} #41#return; {6279#true} is VALID [2022-04-15 06:55:34,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-04-15 06:55:34,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6279#true} is VALID [2022-04-15 06:55:34,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {6279#true} call ULTIMATE.init(); {6279#true} is VALID [2022-04-15 06:55:34,680 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:55:34,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390718662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:34,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:34,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:35,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715895833] [2022-04-15 06:55:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715895833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:35,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:35,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:55:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513172539] [2022-04-15 06:55:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:55:35,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:35,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:35,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:35,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:55:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:35,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:55:35,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:55:35,346 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:37,166 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-15 06:55:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:55:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:55:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-15 06:55:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2022-04-15 06:55:37,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 65 transitions. [2022-04-15 06:55:37,213 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:55:37,214 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:55:37,214 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:55:37,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=2740, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:55:37,215 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:37,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:55:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:55:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 06:55:37,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:37,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,320 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,320 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:37,320 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 06:55:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 06:55:37,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:37,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:37,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:55:37,321 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:55:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:37,321 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 06:55:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 06:55:37,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:37,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:37,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:37,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 06:55:37,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 49 [2022-04-15 06:55:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:37,322 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 06:55:37,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:37,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 06:55:37,371 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:55:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 06:55:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 06:55:37,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:37,372 INFO L499 BasicCegarLoop]: trace histogram [20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:37,389 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:55:37,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:37,572 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1673756829, now seen corresponding path program 18 times [2022-04-15 06:55:37,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:37,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [585334804] [2022-04-15 06:55:39,808 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:39,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:43,969 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:44,055 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:44,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1085979823, now seen corresponding path program 1 times [2022-04-15 06:55:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:44,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018630260] [2022-04-15 06:55:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:44,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-15 06:55:44,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-15 06:55:44,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-15 06:55:44,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:44,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-15 06:55:44,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-15 06:55:44,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-15 06:55:44,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-15 06:55:44,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6779#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:44,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {6779#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:44,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:44,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {6780#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6781#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:55:44,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:44,199 INFO L272 TraceCheckUtils]: 10: Hoare triple {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:44,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:44,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6775#false} is VALID [2022-04-15 06:55:44,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-15 06:55:44,199 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:55:44,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:44,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018630260] [2022-04-15 06:55:44,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018630260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:44,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4611907] [2022-04-15 06:55:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:44,204 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:55:44,206 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:55:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:44,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:44,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:44,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2022-04-15 06:55:44,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-15 06:55:44,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-15 06:55:44,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-15 06:55:44,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-15 06:55:44,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6804#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:44,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#(and (<= main_~x~0 0) (= main_~y~0 500000))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:44,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:44,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {6808#(and (= main_~y~0 500000) (< main_~x~0 500001))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6815#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:44,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {6815#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6819#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:44,557 INFO L272 TraceCheckUtils]: 10: Hoare triple {6819#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:44,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:44,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {6827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6775#false} is VALID [2022-04-15 06:55:44,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-15 06:55:44,559 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:55:44,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:44,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {6775#false} assume !false; {6775#false} is VALID [2022-04-15 06:55:44,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {6827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6775#false} is VALID [2022-04-15 06:55:44,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:44,878 INFO L272 TraceCheckUtils]: 10: Hoare triple {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {6823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:44,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {6846#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [116] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {6782#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:44,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [119] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_495)) (.cse2 (= v_main_~x~0_495 v_main_~x~0_494)) (.cse3 (= v_main_~y~0_313 v_main_~y~0_312))) (or (let ((.cse1 (+ v_main_~x~0_495 v_main_~y~0_312))) (and .cse0 (= .cse1 (+ v_main_~x~0_494 v_main_~y~0_313)) (< .cse1 (+ v_main_~y~0_313 1000001)) (< v_main_~y~0_313 v_main_~y~0_312))) (and (or (not .cse0) (not (< v_main_~x~0_495 1000000))) .cse2 .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_495, main_~y~0=v_main_~y~0_313} OutVars{main_~x~0=v_main_~x~0_494, main_~y~0=v_main_~y~0_312} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6846#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:44,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [118] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:44,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {6857#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [117] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_493 v_main_~x~0_492))) (or (and (< v_main_~x~0_492 500001) (< v_main_~x~0_493 v_main_~x~0_492)) (and (not (< v_main_~x~0_493 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[main_~x~0] {6850#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:44,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {6774#true} ~x~0 := 0;~y~0 := 500000; {6857#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:44,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {6774#true} call #t~ret4 := main(); {6774#true} is VALID [2022-04-15 06:55:44,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6774#true} {6774#true} #41#return; {6774#true} is VALID [2022-04-15 06:55:44,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {6774#true} assume true; {6774#true} is VALID [2022-04-15 06:55:44,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {6774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6774#true} is VALID [2022-04-15 06:55:44,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {6774#true} call ULTIMATE.init(); {6774#true} is VALID [2022-04-15 06:55:44,881 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:55:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4611907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:44,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:45,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:45,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [585334804] [2022-04-15 06:55:45,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [585334804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:45,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:45,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:55:45,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358524654] [2022-04-15 06:55:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 06:55:45,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:45,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:45,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:55:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:55:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:55:45,501 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:46,864 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-04-15 06:55:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:55:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 06:55:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-15 06:55:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-15 06:55:46,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 67 transitions. [2022-04-15 06:55:46,912 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:55:46,913 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:55:46,913 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:55:46,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=471, Invalid=2951, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:55:46,914 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:46,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 63 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:55:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:55:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 06:55:47,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:47,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:47,025 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:47,025 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:47,025 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-15 06:55:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 06:55:47,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:47,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:47,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:55:47,026 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:55:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:47,026 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-04-15 06:55:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 06:55:47,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:47,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:47,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:47,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-15 06:55:47,027 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 51 [2022-04-15 06:55:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:47,027 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-15 06:55:47,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:47,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-15 06:55:47,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 06:55:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:55:47,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:47,070 INFO L499 BasicCegarLoop]: trace histogram [21, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:47,086 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:55:47,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:47,287 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1926111106, now seen corresponding path program 19 times [2022-04-15 06:55:47,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:47,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704865967] [2022-04-15 06:55:47,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:47,557 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:47,558 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1159455313, now seen corresponding path program 1 times [2022-04-15 06:55:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:47,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155266722] [2022-04-15 06:55:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:47,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-15 06:55:47,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-15 06:55:47,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-15 06:55:47,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:47,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-15 06:55:47,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-15 06:55:47,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-15 06:55:47,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-15 06:55:47,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7289#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:47,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {7289#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:47,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:47,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {7290#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7291#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:47,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {7291#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:47,645 INFO L272 TraceCheckUtils]: 10: Hoare triple {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:47,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {7293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:47,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {7294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7285#false} is VALID [2022-04-15 06:55:47,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-15 06:55:47,645 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:55:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:47,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155266722] [2022-04-15 06:55:47,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155266722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:47,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054463172] [2022-04-15 06:55:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:47,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:47,647 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:55:47,648 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:55:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:47,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:47,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:48,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7284#true} is VALID [2022-04-15 06:55:48,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-15 06:55:48,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-15 06:55:48,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-15 06:55:48,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-15 06:55:48,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7314#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:55:48,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {7314#(and (<= main_~x~0 0) (= main_~y~0 500000))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:48,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:48,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {7318#(and (= main_~y~0 500000) (< main_~x~0 500001))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7325#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:48,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {7325#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:48,046 INFO L272 TraceCheckUtils]: 10: Hoare triple {7329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:48,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:48,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {7337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7285#false} is VALID [2022-04-15 06:55:48,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-15 06:55:48,047 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:55:48,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:48,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#false} assume !false; {7285#false} is VALID [2022-04-15 06:55:48,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {7337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7285#false} is VALID [2022-04-15 06:55:48,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:55:48,354 INFO L272 TraceCheckUtils]: 10: Hoare triple {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:48,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {7356#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [120] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7292#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:55:48,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [123] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_532)) (.cse1 (= v_main_~x~0_532 v_main_~x~0_531))) (or (and (< v_main_~x~0_531 1000001) (= (+ v_main_~x~0_532 v_main_~y~0_339) (+ v_main_~x~0_531 v_main_~y~0_340)) .cse0 (< v_main_~x~0_532 v_main_~x~0_531)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_532 1000000))) (= v_main_~y~0_339 v_main_~y~0_340)) (and .cse1 (= v_main_~y~0_340 v_main_~y~0_339)))) InVars {main_~x~0=v_main_~x~0_532, main_~y~0=v_main_~y~0_340} OutVars{main_~x~0=v_main_~x~0_531, main_~y~0=v_main_~y~0_339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7356#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:48,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [122] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:48,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [121] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_530 v_main_~x~0_529) (< v_main_~x~0_529 500001)) (= v_main_~x~0_530 v_main_~x~0_529) (and (= v_main_~x~0_529 v_main_~x~0_530) (<= 500000 v_main_~x~0_530))) InVars {main_~x~0=v_main_~x~0_530} OutVars{main_~x~0=v_main_~x~0_529} AuxVars[] AssignedVars[main_~x~0] {7360#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:48,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {7284#true} ~x~0 := 0;~y~0 := 500000; {7367#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:55:48,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {7284#true} call #t~ret4 := main(); {7284#true} is VALID [2022-04-15 06:55:48,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7284#true} {7284#true} #41#return; {7284#true} is VALID [2022-04-15 06:55:48,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {7284#true} assume true; {7284#true} is VALID [2022-04-15 06:55:48,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {7284#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7284#true} is VALID [2022-04-15 06:55:48,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {7284#true} call ULTIMATE.init(); {7284#true} is VALID [2022-04-15 06:55:48,358 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:55:48,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054463172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:48,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:48,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:55:49,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:49,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704865967] [2022-04-15 06:55:49,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704865967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:49,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:49,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:55:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910081382] [2022-04-15 06:55:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:49,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:49,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:49,180 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:55:49,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:55:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:55:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:55:49,182 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:50,846 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-15 06:55:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:55:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-15 06:55:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-15 06:55:50,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 69 transitions. [2022-04-15 06:55:50,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:50,904 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:55:50,904 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:55:50,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=490, Invalid=3170, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:55:50,905 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:50,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:55:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:55:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 06:55:50,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:50,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:50,990 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:50,990 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:50,991 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-04-15 06:55:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 06:55:50,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:50,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:50,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:55:50,991 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:55:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:50,992 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-04-15 06:55:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 06:55:50,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:50,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:50,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:50,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-15 06:55:50,993 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 53 [2022-04-15 06:55:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:50,993 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-15 06:55:50,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 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:55:50,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-15 06:55:51,038 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:55:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 06:55:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:55:51,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:51,038 INFO L499 BasicCegarLoop]: trace histogram [22, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:51,056 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:55:51,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:51,257 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 374564569, now seen corresponding path program 20 times [2022-04-15 06:55:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149781692] [2022-04-15 06:55:55,317 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:55,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:59,474 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:59,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:59,573 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 890076847, now seen corresponding path program 1 times [2022-04-15 06:55:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:59,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872003067] [2022-04-15 06:55:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {7820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-15 06:55:59,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-15 06:55:59,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-15 06:55:59,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:59,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {7820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-15 06:55:59,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-15 06:55:59,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-15 06:55:59,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-15 06:55:59,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7814#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:55:59,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {7814#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:59,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:55:59,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {7815#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7816#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:55:59,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {7816#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:55:59,678 INFO L272 TraceCheckUtils]: 10: Hoare triple {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:55:59,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {7818#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:59,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {7819#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7810#false} is VALID [2022-04-15 06:55:59,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-15 06:55:59,679 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:55:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:59,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872003067] [2022-04-15 06:55:59,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872003067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:59,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886478535] [2022-04-15 06:55:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:59,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:59,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:59,680 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:55:59,682 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:55:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:59,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:00,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7809#true} is VALID [2022-04-15 06:56:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-15 06:56:00,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-15 06:56:00,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-15 06:56:00,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-15 06:56:00,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7839#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:00,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {7839#(and (<= main_~x~0 0) (= main_~y~0 500000))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:00,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:00,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#(and (= main_~y~0 500000) (< main_~x~0 500001))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7850#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:00,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {7850#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7854#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:00,074 INFO L272 TraceCheckUtils]: 10: Hoare triple {7854#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:00,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:00,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {7862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7810#false} is VALID [2022-04-15 06:56:00,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-15 06:56:00,075 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:56:00,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:00,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#false} assume !false; {7810#false} is VALID [2022-04-15 06:56:00,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {7862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7810#false} is VALID [2022-04-15 06:56:00,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:00,311 INFO L272 TraceCheckUtils]: 10: Hoare triple {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {7858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:00,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {7881#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [124] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {7817#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:00,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [127] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_570))) (or (and (= v_main_~y~0_368 v_main_~y~0_367) (= v_main_~x~0_570 v_main_~x~0_569)) (and (< v_main_~x~0_569 1000001) (< v_main_~x~0_570 v_main_~x~0_569) (= (+ v_main_~x~0_570 v_main_~y~0_367) (+ v_main_~x~0_569 v_main_~y~0_368)) .cse0) (and (or (not (< v_main_~x~0_570 1000000)) (not .cse0)) (= v_main_~x~0_569 v_main_~x~0_570) (= v_main_~y~0_367 v_main_~y~0_368)))) InVars {main_~x~0=v_main_~x~0_570, main_~y~0=v_main_~y~0_368} OutVars{main_~x~0=v_main_~x~0_569, main_~y~0=v_main_~y~0_367} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7881#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:00,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [126] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:00,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {7892#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [125] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (<= 500000 v_main_~x~0_568) .cse0) (and (< v_main_~x~0_567 500001) (< v_main_~x~0_568 v_main_~x~0_567)) .cse0)) InVars {main_~x~0=v_main_~x~0_568} OutVars{main_~x~0=v_main_~x~0_567} AuxVars[] AssignedVars[main_~x~0] {7885#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:00,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#true} ~x~0 := 0;~y~0 := 500000; {7892#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:00,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#true} call #t~ret4 := main(); {7809#true} is VALID [2022-04-15 06:56:00,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#true} {7809#true} #41#return; {7809#true} is VALID [2022-04-15 06:56:00,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#true} assume true; {7809#true} is VALID [2022-04-15 06:56:00,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {7809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7809#true} is VALID [2022-04-15 06:56:00,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {7809#true} call ULTIMATE.init(); {7809#true} is VALID [2022-04-15 06:56:00,314 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:56:00,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886478535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:00,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:00,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:00,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [149781692] [2022-04-15 06:56:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [149781692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:00,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:00,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:56:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557851774] [2022-04-15 06:56:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:00,880 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:56:00,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:00,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:00,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:56:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:00,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:56:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:56:00,907 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,651 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-15 06:56:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:56:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:56:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-15 06:56:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-15 06:56:02,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2022-04-15 06:56:02,691 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:56:02,692 INFO L225 Difference]: With dead ends: 66 [2022-04-15 06:56:02,692 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:56:02,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=509, Invalid=3397, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:56:02,693 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:02,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:56:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:56:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 06:56:02,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:02,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,791 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,791 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,792 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-15 06:56:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 06:56:02,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:02,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:02,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:56:02,792 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:56:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:02,793 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-15 06:56:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 06:56:02,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:02,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:02,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:02,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-15 06:56:02,794 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 55 [2022-04-15 06:56:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:02,794 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-15 06:56:02,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:02,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-15 06:56:02,859 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:56:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 06:56:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:56:02,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:02,860 INFO L499 BasicCegarLoop]: trace histogram [23, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:02,878 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:56:03,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 06:56:03,061 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash -584269196, now seen corresponding path program 21 times [2022-04-15 06:56:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:03,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473462900] [2022-04-15 06:56:03,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:07,277 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:07,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:07,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1355358289, now seen corresponding path program 1 times [2022-04-15 06:56:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:07,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401862658] [2022-04-15 06:56:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:07,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {8360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-15 06:56:07,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-15 06:56:07,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-15 06:56:07,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:07,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {8360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-15 06:56:07,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-15 06:56:07,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-15 06:56:07,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-15 06:56:07,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8354#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:07,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {8354#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:07,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:07,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {8355#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8356#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:56:07,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {8356#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:07,431 INFO L272 TraceCheckUtils]: 10: Hoare triple {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:07,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {8358#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8359#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:07,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {8359#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8350#false} is VALID [2022-04-15 06:56:07,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-15 06:56:07,432 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:56:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:07,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401862658] [2022-04-15 06:56:07,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401862658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:07,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249675628] [2022-04-15 06:56:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:07,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:07,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:07,433 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:56:07,434 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:56:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:07,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:07,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:07,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8349#true} is VALID [2022-04-15 06:56:07,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-15 06:56:07,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-15 06:56:07,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-15 06:56:07,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-15 06:56:07,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8379#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:07,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {8379#(and (<= main_~x~0 0) (= main_~y~0 500000))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:07,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:07,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {8383#(and (= main_~y~0 500000) (< main_~x~0 500001))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8390#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:07,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {8390#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8394#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:07,709 INFO L272 TraceCheckUtils]: 10: Hoare triple {8394#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:07,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:07,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {8402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8350#false} is VALID [2022-04-15 06:56:07,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-15 06:56:07,710 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:56:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:07,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-04-15 06:56:07,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {8402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8350#false} is VALID [2022-04-15 06:56:07,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:07,943 INFO L272 TraceCheckUtils]: 10: Hoare triple {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:07,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {8421#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [128] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8357#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:07,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [131] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_609 v_main_~x~0_608)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (<= 500000 v_main_~x~0_609))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_609 1000000)) (not .cse2))) (let ((.cse3 (+ v_main_~x~0_609 v_main_~y~0_396))) (and (= .cse3 (+ v_main_~x~0_608 v_main_~y~0_397)) (< v_main_~y~0_397 v_main_~y~0_396) .cse2 (< .cse3 (+ v_main_~y~0_397 1000001)))))) InVars {main_~x~0=v_main_~x~0_609, main_~y~0=v_main_~y~0_397} OutVars{main_~x~0=v_main_~x~0_608, main_~y~0=v_main_~y~0_396} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8421#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:07,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [130] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:07,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {8432#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [129] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_607 v_main_~x~0_606))) (or (and (< v_main_~x~0_607 v_main_~x~0_606) (< v_main_~x~0_606 500001)) (and .cse0 (not (< v_main_~x~0_607 500000))) .cse0)) InVars {main_~x~0=v_main_~x~0_607} OutVars{main_~x~0=v_main_~x~0_606} AuxVars[] AssignedVars[main_~x~0] {8425#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:07,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {8349#true} ~x~0 := 0;~y~0 := 500000; {8432#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:07,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {8349#true} call #t~ret4 := main(); {8349#true} is VALID [2022-04-15 06:56:07,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8349#true} {8349#true} #41#return; {8349#true} is VALID [2022-04-15 06:56:07,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {8349#true} assume true; {8349#true} is VALID [2022-04-15 06:56:07,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8349#true} is VALID [2022-04-15 06:56:07,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {8349#true} call ULTIMATE.init(); {8349#true} is VALID [2022-04-15 06:56:07,947 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:56:07,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249675628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:07,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:07,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:08,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:08,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473462900] [2022-04-15 06:56:08,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473462900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:08,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:08,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:56:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417135785] [2022-04-15 06:56:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:56:08,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:08,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:08,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:08,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:56:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:56:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:56:08,667 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:10,887 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-15 06:56:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:56:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:56:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-15 06:56:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-15 06:56:10,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-15 06:56:10,948 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:56:10,949 INFO L225 Difference]: With dead ends: 68 [2022-04-15 06:56:10,949 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:56:10,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=3632, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:56:10,950 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:10,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 108 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:56:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:56:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 06:56:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:11,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:11,101 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:11,101 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:11,102 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-15 06:56:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-15 06:56:11,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:11,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:11,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 06:56:11,102 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 06:56:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:11,103 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-15 06:56:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-15 06:56:11,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:11,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:11,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:11,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-04-15 06:56:11,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 57 [2022-04-15 06:56:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:11,104 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-04-15 06:56:11,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 27 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:11,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2022-04-15 06:56:11,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-15 06:56:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:56:11,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:11,159 INFO L499 BasicCegarLoop]: trace histogram [24, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:11,176 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:56:11,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 06:56:11,360 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1394451279, now seen corresponding path program 22 times [2022-04-15 06:56:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:11,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499437296] [2022-04-15 06:56:15,426 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:15,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:15,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:15,665 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 694173871, now seen corresponding path program 1 times [2022-04-15 06:56:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:15,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66662419] [2022-04-15 06:56:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {8915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-15 06:56:15,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-15 06:56:15,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-15 06:56:15,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:15,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {8915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-15 06:56:15,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-15 06:56:15,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-15 06:56:15,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-15 06:56:15,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8909#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:15,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {8909#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:15,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:15,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {8910#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8911#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:15,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {8911#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:56:15,768 INFO L272 TraceCheckUtils]: 10: Hoare triple {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:15,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {8913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8914#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:15,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {8914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8905#false} is VALID [2022-04-15 06:56:15,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-15 06:56:15,769 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:56:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:15,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66662419] [2022-04-15 06:56:15,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66662419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:15,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650710733] [2022-04-15 06:56:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:15,770 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:56:15,793 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:56:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:16,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8904#true} is VALID [2022-04-15 06:56:16,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-15 06:56:16,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-15 06:56:16,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-15 06:56:16,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-15 06:56:16,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8934#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:16,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {8934#(and (<= main_~x~0 0) (= main_~y~0 500000))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:16,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:16,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {8938#(and (= main_~y~0 500000) (< main_~x~0 500001))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8945#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:16,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {8945#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8949#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:16,149 INFO L272 TraceCheckUtils]: 10: Hoare triple {8949#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:16,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:16,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8905#false} is VALID [2022-04-15 06:56:16,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-15 06:56:16,150 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:56:16,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:16,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {8905#false} assume !false; {8905#false} is VALID [2022-04-15 06:56:16,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8905#false} is VALID [2022-04-15 06:56:16,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8957#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:16,420 INFO L272 TraceCheckUtils]: 10: Hoare triple {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {8953#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:16,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {8976#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [132] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {8912#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:56:16,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [135] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_649 v_main_~x~0_648)) (.cse2 (= v_main_~y~0_427 v_main_~y~0_426)) (.cse0 (<= 500000 v_main_~x~0_649))) (or (and .cse0 (= (+ v_main_~x~0_649 v_main_~y~0_426) (+ v_main_~x~0_648 v_main_~y~0_427)) (< v_main_~x~0_649 v_main_~x~0_648) (< v_main_~x~0_648 1000001)) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_649 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_649, main_~y~0=v_main_~y~0_427} OutVars{main_~x~0=v_main_~x~0_648, main_~y~0=v_main_~y~0_426} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8976#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:16,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [134] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:16,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {8987#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [133] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_647 v_main_~x~0_646))) (or .cse0 (and .cse0 (not (< v_main_~x~0_647 500000))) (and (< v_main_~x~0_646 500001) (< v_main_~x~0_647 v_main_~x~0_646)))) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[main_~x~0] {8980#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:16,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {8904#true} ~x~0 := 0;~y~0 := 500000; {8987#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-15 06:56:16,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {8904#true} call #t~ret4 := main(); {8904#true} is VALID [2022-04-15 06:56:16,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8904#true} {8904#true} #41#return; {8904#true} is VALID [2022-04-15 06:56:16,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {8904#true} assume true; {8904#true} is VALID [2022-04-15 06:56:16,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8904#true} is VALID [2022-04-15 06:56:16,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {8904#true} call ULTIMATE.init(); {8904#true} is VALID [2022-04-15 06:56:16,423 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:56:16,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650710733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:16,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:17,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499437296] [2022-04-15 06:56:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499437296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:17,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:56:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504213752] [2022-04-15 06:56:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:17,088 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:17,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:17,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:17,116 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:56:17,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:56:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:56:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:56:17,117 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:19,088 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-15 06:56:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:56:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 06:56:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-15 06:56:19,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-15 06:56:19,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:19,134 INFO L225 Difference]: With dead ends: 70 [2022-04-15 06:56:19,134 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:56:19,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=547, Invalid=3875, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:56:19,135 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:19,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 128 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:56:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:56:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 06:56:19,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:19,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:19,224 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:19,224 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:19,225 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-15 06:56:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 06:56:19,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:19,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:19,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:56:19,225 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:56:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:19,247 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-04-15 06:56:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 06:56:19,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:19,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:19,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:19,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-15 06:56:19,249 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 59 [2022-04-15 06:56:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:19,249 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-15 06:56:19,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 28 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:56:19,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-15 06:56:19,304 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:56:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 06:56:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:56:19,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:19,304 INFO L499 BasicCegarLoop]: trace histogram [25, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:19,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:56:19,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:19,505 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 274315626, now seen corresponding path program 23 times [2022-04-15 06:56:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:19,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017548389] [2022-04-15 06:56:21,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:21,791 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:21,792 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1551261265, now seen corresponding path program 1 times [2022-04-15 06:56:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:21,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163223278] [2022-04-15 06:56:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:21,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {9485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-15 06:56:21,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-15 06:56:21,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-15 06:56:21,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:21,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {9485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-15 06:56:21,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-15 06:56:21,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-15 06:56:21,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-15 06:56:21,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9479#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:21,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {9479#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:21,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:21,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {9480#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:21,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:21,880 INFO L272 TraceCheckUtils]: 10: Hoare triple {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9483#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:21,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {9483#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9484#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:21,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {9484#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9475#false} is VALID [2022-04-15 06:56:21,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-15 06:56:21,881 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:56:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:21,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163223278] [2022-04-15 06:56:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163223278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:21,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880450354] [2022-04-15 06:56:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:21,884 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:56:21,885 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:56:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:21,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:21,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:22,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9474#true} is VALID [2022-04-15 06:56:22,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-15 06:56:22,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-15 06:56:22,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-15 06:56:22,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-15 06:56:22,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9504#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:22,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {9504#(and (<= main_~x~0 0) (= main_~y~0 500000))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:22,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:22,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {9508#(and (= main_~y~0 500000) (< main_~x~0 500001))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9515#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:22,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {9515#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9519#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:22,284 INFO L272 TraceCheckUtils]: 10: Hoare triple {9519#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:22,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:22,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9475#false} is VALID [2022-04-15 06:56:22,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-15 06:56:22,285 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:56:22,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:22,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-04-15 06:56:22,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9475#false} is VALID [2022-04-15 06:56:22,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:22,607 INFO L272 TraceCheckUtils]: 10: Hoare triple {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {9523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:22,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [136] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {9482#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:22,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [139] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_690)) (.cse0 (= v_main_~y~0_458 v_main_~y~0_457))) (or (and .cse0 (= v_main_~x~0_689 v_main_~x~0_690) (or (not (< v_main_~x~0_690 1000000)) (not .cse1))) (let ((.cse2 (+ v_main_~x~0_690 v_main_~y~0_457))) (and .cse1 (< .cse2 (+ v_main_~y~0_458 1000001)) (< v_main_~y~0_458 v_main_~y~0_457) (= .cse2 (+ v_main_~x~0_689 v_main_~y~0_458)))) (and .cse0 (= v_main_~x~0_690 v_main_~x~0_689)))) InVars {main_~x~0=v_main_~x~0_690, main_~y~0=v_main_~y~0_458} OutVars{main_~x~0=v_main_~x~0_689, main_~y~0=v_main_~y~0_457} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {9481#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:22,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [138] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:22,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {9556#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [137] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_687 v_main_~x~0_688) (not (< v_main_~x~0_688 500000))) (and (< v_main_~x~0_687 500001) (< v_main_~x~0_688 v_main_~x~0_687)) (= v_main_~x~0_688 v_main_~x~0_687)) InVars {main_~x~0=v_main_~x~0_688} OutVars{main_~x~0=v_main_~x~0_687} AuxVars[] AssignedVars[main_~x~0] {9549#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:22,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} ~x~0 := 0;~y~0 := 500000; {9556#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:22,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {9474#true} call #t~ret4 := main(); {9474#true} is VALID [2022-04-15 06:56:22,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9474#true} {9474#true} #41#return; {9474#true} is VALID [2022-04-15 06:56:22,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume true; {9474#true} is VALID [2022-04-15 06:56:22,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9474#true} is VALID [2022-04-15 06:56:22,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {9474#true} call ULTIMATE.init(); {9474#true} is VALID [2022-04-15 06:56:22,610 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:56:22,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880450354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:22,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:22,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 06:56:23,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017548389] [2022-04-15 06:56:23,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017548389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:23,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:23,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:56:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353676788] [2022-04-15 06:56:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:56:23,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:23,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:23,647 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:56:23,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:56:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:56:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:56:23,648 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:26,485 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-04-15 06:56:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:56:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:56:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-15 06:56:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 77 transitions. [2022-04-15 06:56:26,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 77 transitions. [2022-04-15 06:56:26,549 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:56:26,549 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:56:26,549 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:56:26,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=503, Invalid=4053, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:56:26,550 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:26,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 78 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:56:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:56:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 06:56:26,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:26,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,714 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,715 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:26,715 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 06:56:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 06:56:26,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:26,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:26,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:56:26,716 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:56:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:26,717 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 06:56:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 06:56:26,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:26,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:26,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:26,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-15 06:56:26,718 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 61 [2022-04-15 06:56:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:26,718 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-15 06:56:26,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:26,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-15 06:56:26,778 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:56:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 06:56:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 06:56:26,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:26,778 INFO L499 BasicCegarLoop]: trace histogram [26, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:26,797 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:56:26,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:26,979 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1860744389, now seen corresponding path program 24 times [2022-04-15 06:56:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384288650] [2022-04-15 06:56:27,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:27,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:27,279 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 498270895, now seen corresponding path program 1 times [2022-04-15 06:56:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:27,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302589287] [2022-04-15 06:56:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {10069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-15 06:56:27,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-15 06:56:27,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-15 06:56:27,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:27,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {10069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-15 06:56:27,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-15 06:56:27,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-15 06:56:27,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-15 06:56:27,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10063#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:27,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {10063#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:27,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:27,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {10064#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:27,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:27,361 INFO L272 TraceCheckUtils]: 10: Hoare triple {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:27,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {10067#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10068#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:27,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {10068#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10059#false} is VALID [2022-04-15 06:56:27,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-15 06:56:27,362 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:56:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:27,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302589287] [2022-04-15 06:56:27,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302589287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:27,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236500700] [2022-04-15 06:56:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:27,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:27,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:27,363 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:56:27,364 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:56:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:27,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10058#true} is VALID [2022-04-15 06:56:27,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-15 06:56:27,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-15 06:56:27,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-15 06:56:27,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-15 06:56:27,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10088#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:27,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {10088#(and (<= main_~x~0 0) (= main_~y~0 500000))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:27,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:27,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {10092#(and (= main_~y~0 500000) (< main_~x~0 500001))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10099#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:27,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {10099#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:27,756 INFO L272 TraceCheckUtils]: 10: Hoare triple {10103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:27,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:27,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {10111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10059#false} is VALID [2022-04-15 06:56:27,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-15 06:56:27,757 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:56:27,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:28,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#false} assume !false; {10059#false} is VALID [2022-04-15 06:56:28,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {10111#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10059#false} is VALID [2022-04-15 06:56:28,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10111#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:28,024 INFO L272 TraceCheckUtils]: 10: Hoare triple {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10107#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:28,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [140] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10066#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:28,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [143] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_732)) (.cse0 (= v_main_~x~0_732 v_main_~x~0_731))) (or (and .cse0 (= v_main_~y~0_489 v_main_~y~0_490) (or (not .cse1) (not (< v_main_~x~0_732 1000000)))) (let ((.cse2 (+ v_main_~x~0_732 v_main_~y~0_489))) (and (< v_main_~y~0_490 v_main_~y~0_489) (< .cse2 (+ v_main_~y~0_490 1000001)) (= .cse2 (+ v_main_~x~0_731 v_main_~y~0_490)) .cse1)) (and .cse0 (= v_main_~y~0_490 v_main_~y~0_489)))) InVars {main_~x~0=v_main_~x~0_732, main_~y~0=v_main_~y~0_490} OutVars{main_~x~0=v_main_~x~0_731, main_~y~0=v_main_~y~0_489} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10065#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:28,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [142] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:28,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [141] L11-2-->L10-2_primed: Formula: (or (and (= v_main_~x~0_729 v_main_~x~0_730) (not (< v_main_~x~0_730 500000))) (= v_main_~x~0_730 v_main_~x~0_729) (and (< v_main_~x~0_730 v_main_~x~0_729) (< v_main_~x~0_729 500001))) InVars {main_~x~0=v_main_~x~0_730} OutVars{main_~x~0=v_main_~x~0_729} AuxVars[] AssignedVars[main_~x~0] {10133#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:28,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {10058#true} ~x~0 := 0;~y~0 := 500000; {10140#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:28,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {10058#true} call #t~ret4 := main(); {10058#true} is VALID [2022-04-15 06:56:28,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10058#true} {10058#true} #41#return; {10058#true} is VALID [2022-04-15 06:56:28,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {10058#true} assume true; {10058#true} is VALID [2022-04-15 06:56:28,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {10058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10058#true} is VALID [2022-04-15 06:56:28,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {10058#true} call ULTIMATE.init(); {10058#true} is VALID [2022-04-15 06:56:28,027 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:56:28,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236500700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:28,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:28,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 06:56:28,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:28,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384288650] [2022-04-15 06:56:28,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384288650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:28,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:28,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:56:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891264497] [2022-04-15 06:56:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 06:56:28,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:28,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:28,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:28,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:56:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:56:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:56:28,755 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:31,292 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 06:56:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:56:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 06:56:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-15 06:56:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-15 06:56:31,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 79 transitions. [2022-04-15 06:56:31,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:31,379 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:56:31,379 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:56:31,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=520, Invalid=4310, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:56:31,380 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:31,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 143 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:56:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:56:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 06:56:31,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:31,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,486 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,486 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:31,487 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 06:56:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:56:31,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:31,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:31,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:56:31,487 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:56:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:31,488 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 06:56:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:56:31,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:31,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:31,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:31,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-04-15 06:56:31,490 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 63 [2022-04-15 06:56:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:31,490 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-04-15 06:56:31,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 30 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:31,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2022-04-15 06:56:31,534 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:56:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:56:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:56:31,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:31,535 INFO L499 BasicCegarLoop]: trace histogram [27, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:31,553 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:56:31,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:56:31,736 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1705395552, now seen corresponding path program 25 times [2022-04-15 06:56:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:31,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105742468] [2022-04-15 06:56:31,828 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:32,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:32,065 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1747164241, now seen corresponding path program 1 times [2022-04-15 06:56:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:32,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228691086] [2022-04-15 06:56:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:32,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-15 06:56:32,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-15 06:56:32,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-15 06:56:32,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:32,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-15 06:56:32,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-15 06:56:32,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-15 06:56:32,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-15 06:56:32,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10662#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:32,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {10662#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:32,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:32,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {10663#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10664#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:32,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {10664#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:32,148 INFO L272 TraceCheckUtils]: 10: Hoare triple {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:32,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10667#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:32,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10658#false} is VALID [2022-04-15 06:56:32,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-15 06:56:32,148 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:56:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:32,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228691086] [2022-04-15 06:56:32,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228691086] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:32,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762761223] [2022-04-15 06:56:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:32,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:32,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:32,149 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:56:32,150 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:56:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:32,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:32,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:32,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10657#true} is VALID [2022-04-15 06:56:32,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-15 06:56:32,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-15 06:56:32,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-15 06:56:32,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-15 06:56:32,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10687#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:32,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {10687#(and (<= main_~x~0 0) (= main_~y~0 500000))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:32,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:32,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {10691#(and (= main_~y~0 500000) (< main_~x~0 500001))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10698#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:32,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {10698#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10702#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:32,450 INFO L272 TraceCheckUtils]: 10: Hoare triple {10702#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:32,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:32,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10658#false} is VALID [2022-04-15 06:56:32,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-15 06:56:32,450 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:56:32,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:32,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {10658#false} assume !false; {10658#false} is VALID [2022-04-15 06:56:32,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {10710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10658#false} is VALID [2022-04-15 06:56:32,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:32,677 INFO L272 TraceCheckUtils]: 10: Hoare triple {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {10706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:32,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {10729#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [144] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {10665#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:32,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [147] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_775)) (.cse0 (= v_main_~x~0_775 v_main_~x~0_774)) (.cse1 (= v_main_~y~0_523 v_main_~y~0_522))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_775 v_main_~y~0_522))) (and (< .cse2 (+ v_main_~y~0_523 1000001)) (< v_main_~y~0_523 v_main_~y~0_522) (= (+ v_main_~x~0_774 v_main_~y~0_523) .cse2) .cse3)) (and (or (not (< v_main_~x~0_775 1000000)) (not .cse3)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_775, main_~y~0=v_main_~y~0_523} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_522} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {10729#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:32,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [146] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:32,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {10740#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [145] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_773 v_main_~x~0_772))) (or (and .cse0 (not (< v_main_~x~0_773 500000))) .cse0 (and (< v_main_~x~0_773 v_main_~x~0_772) (< v_main_~x~0_772 500001)))) InVars {main_~x~0=v_main_~x~0_773} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[main_~x~0] {10733#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:32,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {10657#true} ~x~0 := 0;~y~0 := 500000; {10740#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:32,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {10657#true} call #t~ret4 := main(); {10657#true} is VALID [2022-04-15 06:56:32,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10657#true} {10657#true} #41#return; {10657#true} is VALID [2022-04-15 06:56:32,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {10657#true} assume true; {10657#true} is VALID [2022-04-15 06:56:32,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {10657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10657#true} is VALID [2022-04-15 06:56:32,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {10657#true} call ULTIMATE.init(); {10657#true} is VALID [2022-04-15 06:56:32,679 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:56:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762761223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:32,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:33,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:33,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105742468] [2022-04-15 06:56:33,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105742468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:33,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:33,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:56:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531935634] [2022-04-15 06:56:33,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:33,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:33,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:33,776 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:56:33,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:56:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:33,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:56:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1682, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:56:33,777 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:36,925 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-04-15 06:56:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:56:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-15 06:56:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 81 transitions. [2022-04-15 06:56:36,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 81 transitions. [2022-04-15 06:56:37,000 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:56:37,001 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:56:37,001 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:56:37,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=604, Invalid=4652, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:56:37,002 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:37,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 153 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:56:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:56:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 06:56:37,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:37,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:37,184 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:37,184 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:37,185 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-15 06:56:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 06:56:37,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:37,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:37,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:56:37,185 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:56:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:37,186 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-15 06:56:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 06:56:37,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:37,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:37,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:37,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-04-15 06:56:37,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 65 [2022-04-15 06:56:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:37,188 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-04-15 06:56:37,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.90625) internal successors, (61), 31 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:56:37,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2022-04-15 06:56:37,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-15 06:56:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:56:37,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:37,252 INFO L499 BasicCegarLoop]: trace histogram [28, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:37,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:56:37,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:56:37,453 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1555948741, now seen corresponding path program 26 times [2022-04-15 06:56:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:37,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280430560] [2022-04-15 06:56:37,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:37,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:37,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 302367919, now seen corresponding path program 1 times [2022-04-15 06:56:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:37,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748624644] [2022-04-15 06:56:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:37,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {11283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:37,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {11283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-15 06:56:37,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-15 06:56:37,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11277#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:37,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {11277#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:37,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:37,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {11278#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:37,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:37,857 INFO L272 TraceCheckUtils]: 10: Hoare triple {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:37,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {11281#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:37,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {11282#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11273#false} is VALID [2022-04-15 06:56:37,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-15 06:56:37,858 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:56:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748624644] [2022-04-15 06:56:37,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748624644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350653429] [2022-04-15 06:56:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:37,859 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:56:37,860 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:56:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:37,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:37,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:38,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11272#true} is VALID [2022-04-15 06:56:38,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-15 06:56:38,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-15 06:56:38,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-15 06:56:38,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-15 06:56:38,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11302#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:38,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {11302#(and (<= main_~x~0 0) (= main_~y~0 500000))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:38,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:38,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {11306#(and (= main_~y~0 500000) (< main_~x~0 500001))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11313#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:38,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {11313#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11317#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:38,289 INFO L272 TraceCheckUtils]: 10: Hoare triple {11317#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:38,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:38,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {11325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11273#false} is VALID [2022-04-15 06:56:38,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-15 06:56:38,290 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:56:38,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:38,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {11273#false} assume !false; {11273#false} is VALID [2022-04-15 06:56:38,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {11325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11273#false} is VALID [2022-04-15 06:56:38,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:38,633 INFO L272 TraceCheckUtils]: 10: Hoare triple {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:38,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [148] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11280#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:38,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [151] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse1 (= v_main_~y~0_557 v_main_~y~0_556)) (.cse2 (<= 500000 v_main_~x~0_819))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_819 1000000))) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_819 v_main_~y~0_556))) (and (< v_main_~y~0_557 v_main_~y~0_556) (= (+ v_main_~x~0_818 v_main_~y~0_557) .cse3) (< .cse3 (+ v_main_~y~0_557 1000001)) .cse2)))) InVars {main_~x~0=v_main_~x~0_819, main_~y~0=v_main_~y~0_557} OutVars{main_~x~0=v_main_~x~0_818, main_~y~0=v_main_~y~0_556} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11279#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:38,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [150] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:38,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {11354#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [149] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816))) (or (and .cse0 (<= 500000 v_main_~x~0_817)) .cse0 (and (< v_main_~x~0_816 500001) (< v_main_~x~0_817 v_main_~x~0_816)))) InVars {main_~x~0=v_main_~x~0_817} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[main_~x~0] {11347#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:38,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {11272#true} ~x~0 := 0;~y~0 := 500000; {11354#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:38,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {11272#true} call #t~ret4 := main(); {11272#true} is VALID [2022-04-15 06:56:38,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11272#true} {11272#true} #41#return; {11272#true} is VALID [2022-04-15 06:56:38,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {11272#true} assume true; {11272#true} is VALID [2022-04-15 06:56:38,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {11272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11272#true} is VALID [2022-04-15 06:56:38,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {11272#true} call ULTIMATE.init(); {11272#true} is VALID [2022-04-15 06:56:38,637 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:56:38,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350653429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:38,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:38,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 06:56:39,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:39,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280430560] [2022-04-15 06:56:39,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280430560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:39,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:39,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:56:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477859081] [2022-04-15 06:56:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:39,728 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:56:39,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:39,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:39,762 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:56:39,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:56:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:56:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:56:39,764 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:42,414 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-04-15 06:56:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:56:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:56:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-15 06:56:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 83 transitions. [2022-04-15 06:56:42,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 83 transitions. [2022-04-15 06:56:42,494 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:56:42,495 INFO L225 Difference]: With dead ends: 78 [2022-04-15 06:56:42,495 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:56:42,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=554, Invalid=4848, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:56:42,496 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:42,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:56:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:56:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 06:56:42,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:42,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,697 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,697 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:42,698 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 06:56:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 06:56:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:56:42,698 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:56:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:42,699 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 06:56:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 06:56:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:42,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:42,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-15 06:56:42,700 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 67 [2022-04-15 06:56:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:42,700 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-15 06:56:42,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:42,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-15 06:56:42,763 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:56:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 06:56:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:56:42,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:42,764 INFO L499 BasicCegarLoop]: trace histogram [29, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:42,782 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:56:42,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:56:42,964 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash -381688234, now seen corresponding path program 27 times [2022-04-15 06:56:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:42,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759897271] [2022-04-15 06:56:43,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:43,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:43,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1943067217, now seen corresponding path program 1 times [2022-04-15 06:56:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:43,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962859592] [2022-04-15 06:56:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {11912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:43,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {11912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-15 06:56:43,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-15 06:56:43,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11906#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:43,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {11906#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:43,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:43,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {11907#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11908#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:43,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {11908#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:56:43,340 INFO L272 TraceCheckUtils]: 10: Hoare triple {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:43,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {11910#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11911#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:43,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {11911#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11902#false} is VALID [2022-04-15 06:56:43,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-15 06:56:43,340 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:56:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:43,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962859592] [2022-04-15 06:56:43,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962859592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256648781] [2022-04-15 06:56:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:43,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:43,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:43,343 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:56:43,350 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:56:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:43,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:43,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11901#true} is VALID [2022-04-15 06:56:43,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-15 06:56:43,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-15 06:56:43,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-15 06:56:43,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-15 06:56:43,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11931#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:43,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#(and (<= main_~x~0 0) (= main_~y~0 500000))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:43,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:43,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {11935#(and (= main_~y~0 500000) (< main_~x~0 500001))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11942#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:43,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {11942#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11946#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:43,751 INFO L272 TraceCheckUtils]: 10: Hoare triple {11946#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:43,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:43,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11902#false} is VALID [2022-04-15 06:56:43,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-15 06:56:43,752 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:56:43,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:44,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {11902#false} assume !false; {11902#false} is VALID [2022-04-15 06:56:44,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11902#false} is VALID [2022-04-15 06:56:44,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:44,057 INFO L272 TraceCheckUtils]: 10: Hoare triple {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {11950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:44,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {11973#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [152] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {11909#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:56:44,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [155] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_864)) (.cse1 (= v_main_~y~0_592 v_main_~y~0_591))) (or (and (= (+ v_main_~x~0_864 v_main_~y~0_591) (+ v_main_~x~0_863 v_main_~y~0_592)) (< v_main_~x~0_863 1000001) .cse0 (< v_main_~x~0_864 v_main_~x~0_863)) (and (= v_main_~x~0_864 v_main_~x~0_863) .cse1) (and (or (not .cse0) (not (< v_main_~x~0_864 1000000))) .cse1 (= v_main_~x~0_863 v_main_~x~0_864)))) InVars {main_~x~0=v_main_~x~0_864, main_~y~0=v_main_~y~0_592} OutVars{main_~x~0=v_main_~x~0_863, main_~y~0=v_main_~y~0_591} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {11973#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:44,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [154] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:44,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {11984#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [153] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_862 v_main_~x~0_861))) (or .cse0 (and (< v_main_~x~0_861 500001) (< v_main_~x~0_862 v_main_~x~0_861)) (and (not (< v_main_~x~0_862 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_862} OutVars{main_~x~0=v_main_~x~0_861} AuxVars[] AssignedVars[main_~x~0] {11977#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:56:44,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {11901#true} ~x~0 := 0;~y~0 := 500000; {11984#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-15 06:56:44,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {11901#true} call #t~ret4 := main(); {11901#true} is VALID [2022-04-15 06:56:44,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11901#true} {11901#true} #41#return; {11901#true} is VALID [2022-04-15 06:56:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {11901#true} assume true; {11901#true} is VALID [2022-04-15 06:56:44,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {11901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11901#true} is VALID [2022-04-15 06:56:44,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {11901#true} call ULTIMATE.init(); {11901#true} is VALID [2022-04-15 06:56:44,060 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:56:44,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256648781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:44,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:45,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759897271] [2022-04-15 06:56:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759897271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:45,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:45,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:56:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8799023] [2022-04-15 06:56:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:45,016 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:56:45,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:45,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:45,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:45,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:56:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:56:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:56:45,070 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:48,427 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-04-15 06:56:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:56:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:56:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-15 06:56:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 85 transitions. [2022-04-15 06:56:48,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 85 transitions. [2022-04-15 06:56:48,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:48,504 INFO L225 Difference]: With dead ends: 80 [2022-04-15 06:56:48,504 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:56:48,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=642, Invalid=5210, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:56:48,505 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:48,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 78 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:56:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:56:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 06:56:48,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:48,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,667 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,668 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:48,668 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-04-15 06:56:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 06:56:48,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:48,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:48,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 06:56:48,669 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 06:56:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:48,669 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2022-04-15 06:56:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 06:56:48,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:48,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:48,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:48,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-15 06:56:48,670 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 69 [2022-04-15 06:56:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:48,671 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-15 06:56:48,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:48,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-15 06:56:48,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 06:56:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:56:48,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:48,779 INFO L499 BasicCegarLoop]: trace histogram [30, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:48,798 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:56:48,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:48,992 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1493739855, now seen corresponding path program 28 times [2022-04-15 06:56:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676363890] [2022-04-15 06:56:51,088 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:51,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:51,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 106464943, now seen corresponding path program 1 times [2022-04-15 06:56:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:51,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215499249] [2022-04-15 06:56:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:51,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {12557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-15 06:56:51,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-15 06:56:51,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-15 06:56:51,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:51,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {12557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-15 06:56:51,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-15 06:56:51,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-15 06:56:51,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-15 06:56:51,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12551#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:51,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {12551#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:51,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:51,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {12552#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12553#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:51,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {12553#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:51,428 INFO L272 TraceCheckUtils]: 10: Hoare triple {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:51,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {12555#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12556#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:51,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {12556#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12547#false} is VALID [2022-04-15 06:56:51,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-15 06:56:51,429 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:56:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:51,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215499249] [2022-04-15 06:56:51,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215499249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:51,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205210390] [2022-04-15 06:56:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:51,430 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:56:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:51,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:51,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:51,533 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:56:51,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12546#true} is VALID [2022-04-15 06:56:51,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-15 06:56:51,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-15 06:56:51,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-15 06:56:51,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-15 06:56:51,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12576#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:51,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {12576#(and (<= main_~x~0 0) (= main_~y~0 500000))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:51,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:51,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {12580#(and (= main_~y~0 500000) (< main_~x~0 500001))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12587#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:51,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {12587#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12591#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:51,895 INFO L272 TraceCheckUtils]: 10: Hoare triple {12591#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:51,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:51,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {12599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12547#false} is VALID [2022-04-15 06:56:51,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-15 06:56:51,896 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:56:51,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:52,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {12547#false} assume !false; {12547#false} is VALID [2022-04-15 06:56:52,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {12599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12547#false} is VALID [2022-04-15 06:56:52,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:52,160 INFO L272 TraceCheckUtils]: 10: Hoare triple {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {12595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:52,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {12618#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [156] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {12554#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:52,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [159] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_910 v_main_~x~0_909)) (.cse1 (= v_main_~y~0_628 v_main_~y~0_627)) (.cse2 (<= 500000 v_main_~x~0_910))) (or (and .cse0 .cse1) (and (or (not .cse2) (not (< v_main_~x~0_910 1000000))) .cse0 .cse1) (and (< v_main_~x~0_910 v_main_~x~0_909) .cse2 (< v_main_~x~0_909 1000001) (= (+ v_main_~x~0_909 v_main_~y~0_628) (+ v_main_~x~0_910 v_main_~y~0_627))))) InVars {main_~x~0=v_main_~x~0_910, main_~y~0=v_main_~y~0_628} OutVars{main_~x~0=v_main_~x~0_909, main_~y~0=v_main_~y~0_627} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {12618#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:52,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [158] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:52,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {12629#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [157] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_908 v_main_~x~0_907))) (or (and (not (< v_main_~x~0_908 500000)) .cse0) (and (< v_main_~x~0_907 500001) (< v_main_~x~0_908 v_main_~x~0_907)) .cse0)) InVars {main_~x~0=v_main_~x~0_908} OutVars{main_~x~0=v_main_~x~0_907} AuxVars[] AssignedVars[main_~x~0] {12622#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:52,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {12546#true} ~x~0 := 0;~y~0 := 500000; {12629#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:56:52,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {12546#true} call #t~ret4 := main(); {12546#true} is VALID [2022-04-15 06:56:52,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12546#true} {12546#true} #41#return; {12546#true} is VALID [2022-04-15 06:56:52,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {12546#true} assume true; {12546#true} is VALID [2022-04-15 06:56:52,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {12546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12546#true} is VALID [2022-04-15 06:56:52,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {12546#true} call ULTIMATE.init(); {12546#true} is VALID [2022-04-15 06:56:52,163 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:56:52,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205210390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:52,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:52,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:56:53,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:53,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676363890] [2022-04-15 06:56:53,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676363890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:53,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:53,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:56:53,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175744345] [2022-04-15 06:56:53,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:53,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:53,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:53,119 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:56:53,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:56:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:56:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:56:53,124 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:56,503 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-15 06:56:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:56:56,504 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-15 06:56:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 87 transitions. [2022-04-15 06:56:56,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 87 transitions. [2022-04-15 06:56:56,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:56,552 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:56:56,552 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:56:56,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=661, Invalid=5501, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:56:56,560 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:56,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:56:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:56:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 06:56:56,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:56,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,678 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,678 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:56,682 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-15 06:56:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 06:56:56,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:56,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:56,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:56:56,682 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:56:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:56,683 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-15 06:56:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 06:56:56,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:56,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:56,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:56,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-15 06:56:56,684 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 71 [2022-04-15 06:56:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:56,684 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-15 06:56:56,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 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:56:56,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-15 06:56:56,784 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:56:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 06:56:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 06:56:56,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:56,785 INFO L499 BasicCegarLoop]: trace histogram [31, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:56,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 06:56:56,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:56,986 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash -728490932, now seen corresponding path program 29 times [2022-04-15 06:56:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:56,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1210870838] [2022-04-15 06:56:59,210 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:59,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:59,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:59,449 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2138970193, now seen corresponding path program 1 times [2022-04-15 06:56:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193505480] [2022-04-15 06:56:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {13217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-15 06:56:59,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-15 06:56:59,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-15 06:56:59,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:59,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {13217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-15 06:56:59,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-15 06:56:59,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-15 06:56:59,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-15 06:56:59,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13211#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:59,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {13211#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:59,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:56:59,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {13212#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13213#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:59,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {13213#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:59,522 INFO L272 TraceCheckUtils]: 10: Hoare triple {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:56:59,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {13215#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13216#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:59,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {13216#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13207#false} is VALID [2022-04-15 06:56:59,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-15 06:56:59,523 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:56:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193505480] [2022-04-15 06:56:59,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193505480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410442204] [2022-04-15 06:56:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:59,524 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:56:59,525 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:56:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:56:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:59,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13206#true} is VALID [2022-04-15 06:56:59,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-15 06:56:59,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-15 06:56:59,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-15 06:56:59,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-15 06:56:59,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13236#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:56:59,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {13236#(and (<= main_~x~0 0) (= main_~y~0 500000))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:59,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:59,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {13240#(and (= main_~y~0 500000) (< main_~x~0 500001))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13247#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:56:59,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {13247#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13251#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:56:59,906 INFO L272 TraceCheckUtils]: 10: Hoare triple {13251#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:59,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:56:59,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13207#false} is VALID [2022-04-15 06:56:59,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-15 06:56:59,907 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:56:59,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:00,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {13207#false} assume !false; {13207#false} is VALID [2022-04-15 06:57:00,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {13259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13207#false} is VALID [2022-04-15 06:57:00,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:00,240 INFO L272 TraceCheckUtils]: 10: Hoare triple {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:00,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {13278#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [160] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13214#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:00,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [163] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_957)) (.cse1 (= v_main_~x~0_957 v_main_~x~0_956))) (or (and (= v_main_~y~0_664 v_main_~y~0_665) (or (not .cse0) (not (< v_main_~x~0_957 1000000))) .cse1) (and (= (+ v_main_~x~0_956 v_main_~y~0_665) (+ v_main_~x~0_957 v_main_~y~0_664)) (< v_main_~x~0_956 1000001) (< v_main_~x~0_957 v_main_~x~0_956) .cse0) (and (= v_main_~y~0_665 v_main_~y~0_664) .cse1))) InVars {main_~x~0=v_main_~x~0_957, main_~y~0=v_main_~y~0_665} OutVars{main_~x~0=v_main_~x~0_956, main_~y~0=v_main_~y~0_664} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13278#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:00,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [162] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:00,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {13289#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [161] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_955 v_main_~x~0_954))) (or (and .cse0 (<= 500000 v_main_~x~0_955)) (and (< v_main_~x~0_955 v_main_~x~0_954) (< v_main_~x~0_954 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_955} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[main_~x~0] {13282#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:00,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {13206#true} ~x~0 := 0;~y~0 := 500000; {13289#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:00,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {13206#true} call #t~ret4 := main(); {13206#true} is VALID [2022-04-15 06:57:00,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13206#true} {13206#true} #41#return; {13206#true} is VALID [2022-04-15 06:57:00,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {13206#true} assume true; {13206#true} is VALID [2022-04-15 06:57:00,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {13206#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13206#true} is VALID [2022-04-15 06:57:00,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {13206#true} call ULTIMATE.init(); {13206#true} is VALID [2022-04-15 06:57:00,243 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:57:00,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410442204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:00,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:00,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:01,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1210870838] [2022-04-15 06:57:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1210870838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:01,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:01,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:57:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305872866] [2022-04-15 06:57:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:57:01,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:01,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:01,535 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:57:01,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:57:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:01,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:57:01,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2022, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:57:01,537 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:05,279 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-15 06:57:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:57:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:57:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-15 06:57:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 89 transitions. [2022-04-15 06:57:05,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 89 transitions. [2022-04-15 06:57:05,333 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:57:05,334 INFO L225 Difference]: With dead ends: 84 [2022-04-15 06:57:05,334 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 06:57:05,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=680, Invalid=5800, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:57:05,335 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:05,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 58 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:57:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 06:57:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 06:57:05,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:05,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,528 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,528 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:05,529 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-15 06:57:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-15 06:57:05,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:05,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:05,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:57:05,529 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:57:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:05,530 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-15 06:57:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-15 06:57:05,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:05,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:05,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:05,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-04-15 06:57:05,531 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 73 [2022-04-15 06:57:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:05,531 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-04-15 06:57:05,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:05,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 80 transitions. [2022-04-15 06:57:05,601 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:57:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-15 06:57:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 06:57:05,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:05,602 INFO L499 BasicCegarLoop]: trace histogram [32, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:05,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:05,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:05,802 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 236316455, now seen corresponding path program 30 times [2022-04-15 06:57:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:05,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1606672025] [2022-04-15 06:57:09,871 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:09,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:10,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:10,146 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -89438033, now seen corresponding path program 1 times [2022-04-15 06:57:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:10,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037877234] [2022-04-15 06:57:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:10,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:10,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {13892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-15 06:57:10,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-15 06:57:10,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-15 06:57:10,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:10,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {13892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-15 06:57:10,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-15 06:57:10,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-15 06:57:10,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-15 06:57:10,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13886#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:10,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {13886#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:10,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:10,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {13887#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13888#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:10,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {13888#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:10,236 INFO L272 TraceCheckUtils]: 10: Hoare triple {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:57:10,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {13890#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13891#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:10,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {13891#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13882#false} is VALID [2022-04-15 06:57:10,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-15 06:57:10,237 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:57:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037877234] [2022-04-15 06:57:10,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037877234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126877193] [2022-04-15 06:57:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:10,238 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:57:10,239 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:57:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:10,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:10,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:10,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13881#true} is VALID [2022-04-15 06:57:10,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-15 06:57:10,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-15 06:57:10,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-15 06:57:10,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-15 06:57:10,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13911#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:57:10,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {13911#(and (<= main_~x~0 0) (= main_~y~0 500000))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:10,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:10,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {13915#(and (= main_~y~0 500000) (< main_~x~0 500001))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13922#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:10,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {13922#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13926#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:10,658 INFO L272 TraceCheckUtils]: 10: Hoare triple {13926#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:10,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:10,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {13934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13882#false} is VALID [2022-04-15 06:57:10,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-15 06:57:10,659 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:57:10,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:10,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {13882#false} assume !false; {13882#false} is VALID [2022-04-15 06:57:10,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {13934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13882#false} is VALID [2022-04-15 06:57:10,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:10,985 INFO L272 TraceCheckUtils]: 10: Hoare triple {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {13930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:10,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {13953#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [164] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {13889#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:10,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [167] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1005 v_main_~x~0_1004)) (.cse0 (<= 500000 v_main_~x~0_1005)) (.cse2 (= v_main_~y~0_703 v_main_~y~0_702))) (or (and (= (+ v_main_~x~0_1004 v_main_~y~0_703) (+ v_main_~x~0_1005 v_main_~y~0_702)) .cse0 (< v_main_~x~0_1004 1000001) (< v_main_~x~0_1005 v_main_~x~0_1004)) (and .cse1 .cse2) (and .cse1 (or (not (< v_main_~x~0_1005 1000000)) (not .cse0)) .cse2))) InVars {main_~x~0=v_main_~x~0_1005, main_~y~0=v_main_~y~0_703} OutVars{main_~x~0=v_main_~x~0_1004, main_~y~0=v_main_~y~0_702} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {13953#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:10,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [166] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:10,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {13964#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [165] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1003 v_main_~x~0_1002))) (or .cse0 (and (< v_main_~x~0_1002 500001) (< v_main_~x~0_1003 v_main_~x~0_1002)) (and .cse0 (<= 500000 v_main_~x~0_1003)))) InVars {main_~x~0=v_main_~x~0_1003} OutVars{main_~x~0=v_main_~x~0_1002} AuxVars[] AssignedVars[main_~x~0] {13957#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:10,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {13881#true} ~x~0 := 0;~y~0 := 500000; {13964#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-15 06:57:10,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {13881#true} call #t~ret4 := main(); {13881#true} is VALID [2022-04-15 06:57:10,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13881#true} {13881#true} #41#return; {13881#true} is VALID [2022-04-15 06:57:10,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {13881#true} assume true; {13881#true} is VALID [2022-04-15 06:57:10,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {13881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13881#true} is VALID [2022-04-15 06:57:10,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {13881#true} call ULTIMATE.init(); {13881#true} is VALID [2022-04-15 06:57:10,988 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:57:10,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126877193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:10,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:10,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:12,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1606672025] [2022-04-15 06:57:12,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1606672025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:12,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:12,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:57:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221156987] [2022-04-15 06:57:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 06:57:12,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:12,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:12,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:12,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:57:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:57:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2112, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:57:12,391 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:16,131 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-15 06:57:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:57:16,132 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 06:57:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-15 06:57:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 91 transitions. [2022-04-15 06:57:16,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 91 transitions. [2022-04-15 06:57:16,187 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:57:16,187 INFO L225 Difference]: With dead ends: 86 [2022-04-15 06:57:16,187 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 06:57:16,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=699, Invalid=6107, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:57:16,188 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:16,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 108 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:57:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 06:57:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 06:57:16,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:16,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,321 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,321 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:16,322 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-15 06:57:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-15 06:57:16,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:16,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:16,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 06:57:16,322 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 06:57:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:16,323 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-04-15 06:57:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-15 06:57:16,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:16,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:16,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:16,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-04-15 06:57:16,324 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 75 [2022-04-15 06:57:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:16,324 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-04-15 06:57:16,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:16,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 82 transitions. [2022-04-15 06:57:16,374 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:57:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-04-15 06:57:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:57:16,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:16,375 INFO L499 BasicCegarLoop]: trace histogram [33, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:16,392 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:57:16,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 06:57:16,592 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -296720574, now seen corresponding path program 31 times [2022-04-15 06:57:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:16,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284295941] [2022-04-15 06:57:16,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:16,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:16,851 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1960094127, now seen corresponding path program 1 times [2022-04-15 06:57:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:16,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732972962] [2022-04-15 06:57:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:16,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {14582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:16,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {14582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-15 06:57:16,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14576#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:16,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {14576#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:16,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:16,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {14577#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14578#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:16,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {14578#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:16,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:57:16,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {14580#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14581#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:16,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {14581#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 06:57:16,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 06:57:16,943 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:57:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732972962] [2022-04-15 06:57:16,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732972962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785061606] [2022-04-15 06:57:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:16,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:16,944 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:57:16,945 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:57:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:16,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:17,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-15 06:57:17,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 06:57:17,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 06:57:17,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-15 06:57:17,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-15 06:57:17,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14601#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:57:17,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {14601#(and (<= main_~x~0 0) (= main_~y~0 500000))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:17,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:17,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {14605#(and (= main_~y~0 500000) (< main_~x~0 500001))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14612#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:17,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {14612#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14616#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:17,215 INFO L272 TraceCheckUtils]: 10: Hoare triple {14616#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:17,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:17,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {14624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 06:57:17,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 06:57:17,216 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:57:17,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:17,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#false} assume !false; {14572#false} is VALID [2022-04-15 06:57:17,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {14624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14572#false} is VALID [2022-04-15 06:57:17,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:17,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {14620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:17,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {14643#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [168] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {14579#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:17,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [171] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1054 v_main_~x~0_1053)) (.cse1 (<= 500000 v_main_~x~0_1054))) (or (and .cse0 (= v_main_~y~0_742 v_main_~y~0_741)) (and (or (not (< v_main_~x~0_1054 1000000)) (not .cse1)) (= v_main_~y~0_741 v_main_~y~0_742) .cse0) (and (= (+ v_main_~x~0_1053 v_main_~y~0_742) (+ v_main_~x~0_1054 v_main_~y~0_741)) (< v_main_~x~0_1053 1000001) (< v_main_~x~0_1054 v_main_~x~0_1053) .cse1))) InVars {main_~x~0=v_main_~x~0_1054, main_~y~0=v_main_~y~0_742} OutVars{main_~x~0=v_main_~x~0_1053, main_~y~0=v_main_~y~0_741} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {14643#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:17,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [170] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:17,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [169] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1052 v_main_~x~0_1051))) (or .cse0 (and (< v_main_~x~0_1051 500001) (< v_main_~x~0_1052 v_main_~x~0_1051)) (and (not (< v_main_~x~0_1052 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1052} OutVars{main_~x~0=v_main_~x~0_1051} AuxVars[] AssignedVars[main_~x~0] {14647#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:17,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {14571#true} ~x~0 := 0;~y~0 := 500000; {14654#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:17,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {14571#true} call #t~ret4 := main(); {14571#true} is VALID [2022-04-15 06:57:17,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14571#true} {14571#true} #41#return; {14571#true} is VALID [2022-04-15 06:57:17,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {14571#true} assume true; {14571#true} is VALID [2022-04-15 06:57:17,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {14571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14571#true} is VALID [2022-04-15 06:57:17,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {14571#true} call ULTIMATE.init(); {14571#true} is VALID [2022-04-15 06:57:17,489 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:57:17,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785061606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:17,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:17,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:18,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:18,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284295941] [2022-04-15 06:57:18,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284295941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:18,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:18,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:57:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088811281] [2022-04-15 06:57:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:18,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:18,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:18,810 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:57:18,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:57:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:18,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:57:18,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2204, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:57:18,810 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:23,126 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-15 06:57:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:57:23,126 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-15 06:57:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 93 transitions. [2022-04-15 06:57:23,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 93 transitions. [2022-04-15 06:57:23,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:23,204 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:57:23,204 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 06:57:23,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=718, Invalid=6422, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:57:23,205 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:23,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 138 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:57:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 06:57:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-15 06:57:23,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:23,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:23,431 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:23,431 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:23,432 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-15 06:57:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-15 06:57:23,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:23,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:23,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 06:57:23,432 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 06:57:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:23,433 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-15 06:57:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-15 06:57:23,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:23,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:23,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:23,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-15 06:57:23,434 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 77 [2022-04-15 06:57:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:23,434 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-15 06:57:23,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 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:57:23,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-15 06:57:23,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-15 06:57:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 06:57:23,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:23,501 INFO L499 BasicCegarLoop]: trace histogram [34, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:23,517 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:57:23,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:23,718 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1444197219, now seen corresponding path program 32 times [2022-04-15 06:57:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:23,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423835921] [2022-04-15 06:57:27,797 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:27,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:28,042 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:28,043 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -285341009, now seen corresponding path program 1 times [2022-04-15 06:57:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:28,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716723095] [2022-04-15 06:57:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:28,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {15287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-15 06:57:28,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-15 06:57:28,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-15 06:57:28,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:28,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {15287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-15 06:57:28,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-15 06:57:28,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-15 06:57:28,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-15 06:57:28,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15281#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:28,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {15281#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:28,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:28,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {15282#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15283#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:28,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {15283#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:28,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15285#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:57:28,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {15285#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15286#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:28,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {15286#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15277#false} is VALID [2022-04-15 06:57:28,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-15 06:57:28,141 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:57:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716723095] [2022-04-15 06:57:28,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716723095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455648083] [2022-04-15 06:57:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:28,152 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:57:28,153 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:57:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:28,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:28,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:28,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15276#true} is VALID [2022-04-15 06:57:28,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-15 06:57:28,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-15 06:57:28,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-15 06:57:28,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-15 06:57:28,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15306#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:57:28,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {15306#(and (<= main_~x~0 0) (= main_~y~0 500000))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:28,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:28,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {15310#(and (= main_~y~0 500000) (< main_~x~0 500001))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15317#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:28,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {15317#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15321#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:28,560 INFO L272 TraceCheckUtils]: 10: Hoare triple {15321#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:28,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:28,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {15329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15277#false} is VALID [2022-04-15 06:57:28,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-15 06:57:28,560 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:57:28,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:28,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {15277#false} assume !false; {15277#false} is VALID [2022-04-15 06:57:28,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {15329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15277#false} is VALID [2022-04-15 06:57:28,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:28,881 INFO L272 TraceCheckUtils]: 10: Hoare triple {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {15325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:28,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {15348#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [172] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {15284#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:28,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [175] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_782 v_main_~y~0_781)) (.cse1 (= v_main_~x~0_1104 v_main_~x~0_1103)) (.cse2 (<= 500000 v_main_~x~0_1104))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1104 1000000)) (not .cse2))) (and .cse0 .cse1) (and (< v_main_~x~0_1103 1000001) (< v_main_~x~0_1104 v_main_~x~0_1103) .cse2 (= (+ v_main_~x~0_1103 v_main_~y~0_782) (+ v_main_~x~0_1104 v_main_~y~0_781))))) InVars {main_~x~0=v_main_~x~0_1104, main_~y~0=v_main_~y~0_782} OutVars{main_~x~0=v_main_~x~0_1103, main_~y~0=v_main_~y~0_781} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {15348#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:28,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [174] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:28,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {15359#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [173] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1102 v_main_~x~0_1101))) (or (and (< v_main_~x~0_1102 v_main_~x~0_1101) (< v_main_~x~0_1101 500001)) (and (not (< v_main_~x~0_1102 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1102} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[main_~x~0] {15352#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:28,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {15276#true} ~x~0 := 0;~y~0 := 500000; {15359#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:28,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {15276#true} call #t~ret4 := main(); {15276#true} is VALID [2022-04-15 06:57:28,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15276#true} {15276#true} #41#return; {15276#true} is VALID [2022-04-15 06:57:28,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {15276#true} assume true; {15276#true} is VALID [2022-04-15 06:57:28,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {15276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15276#true} is VALID [2022-04-15 06:57:28,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {15276#true} call ULTIMATE.init(); {15276#true} is VALID [2022-04-15 06:57:28,896 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:57:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455648083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:28,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:28,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:30,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:30,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423835921] [2022-04-15 06:57:30,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423835921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:30,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:30,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:57:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163925500] [2022-04-15 06:57:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 06:57:30,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:30,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:30,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:30,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:57:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:57:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:57:30,414 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:34,272 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-04-15 06:57:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:57:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 06:57:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-15 06:57:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 95 transitions. [2022-04-15 06:57:34,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 95 transitions. [2022-04-15 06:57:34,374 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:57:34,375 INFO L225 Difference]: With dead ends: 90 [2022-04-15 06:57:34,375 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 06:57:34,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=737, Invalid=6745, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 06:57:34,378 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:34,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 133 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:57:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 06:57:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 06:57:34,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:34,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,543 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,543 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:34,544 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-15 06:57:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-15 06:57:34,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:34,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:34,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 06:57:34,544 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 06:57:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:34,545 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-15 06:57:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-15 06:57:34,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:34,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:34,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:34,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-04-15 06:57:34,547 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 79 [2022-04-15 06:57:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:34,547 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-04-15 06:57:34,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:34,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 86 transitions. [2022-04-15 06:57:34,611 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:57:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-15 06:57:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 06:57:34,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:34,612 INFO L499 BasicCegarLoop]: trace histogram [35, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:34,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:34,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:34,832 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -362657992, now seen corresponding path program 33 times [2022-04-15 06:57:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:34,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643615469] [2022-04-15 06:57:37,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:41,595 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:41,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:41,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1764191151, now seen corresponding path program 1 times [2022-04-15 06:57:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:41,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411027876] [2022-04-15 06:57:41,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:41,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {16007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-15 06:57:41,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-15 06:57:41,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-15 06:57:41,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {16007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:41,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {16007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-15 06:57:41,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-15 06:57:41,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-15 06:57:41,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-15 06:57:41,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16001#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:41,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {16001#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:41,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:41,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {16002#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16003#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:57:41,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {16003#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:41,799 INFO L272 TraceCheckUtils]: 10: Hoare triple {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16005#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:57:41,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {16005#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16006#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:41,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {16006#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15997#false} is VALID [2022-04-15 06:57:41,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-15 06:57:41,799 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:57:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:41,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411027876] [2022-04-15 06:57:41,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411027876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:41,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909818044] [2022-04-15 06:57:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:41,801 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:57:41,801 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:57:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:41,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:41,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:42,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {15996#true} is VALID [2022-04-15 06:57:42,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-15 06:57:42,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-15 06:57:42,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-15 06:57:42,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-15 06:57:42,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16026#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:57:42,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {16026#(and (<= main_~x~0 0) (= main_~y~0 500000))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:42,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:42,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {16030#(and (= main_~y~0 500000) (< main_~x~0 500001))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16037#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:42,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {16037#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16041#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:42,185 INFO L272 TraceCheckUtils]: 10: Hoare triple {16041#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:42,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:42,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {16049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15997#false} is VALID [2022-04-15 06:57:42,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-15 06:57:42,185 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:57:42,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:42,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {15997#false} assume !false; {15997#false} is VALID [2022-04-15 06:57:42,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {16049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15997#false} is VALID [2022-04-15 06:57:42,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:42,520 INFO L272 TraceCheckUtils]: 10: Hoare triple {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:42,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {16068#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [176] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16004#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:42,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [179] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1155 v_main_~x~0_1154)) (.cse1 (= v_main_~y~0_823 v_main_~y~0_822)) (.cse2 (<= 500000 v_main_~x~0_1155))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1155 v_main_~y~0_822))) (and (< v_main_~y~0_823 v_main_~y~0_822) .cse2 (= .cse3 (+ v_main_~x~0_1154 v_main_~y~0_823)) (< .cse3 (+ v_main_~y~0_823 1000001)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_1155 1000000)) (not .cse2))))) InVars {main_~x~0=v_main_~x~0_1155, main_~y~0=v_main_~y~0_823} OutVars{main_~x~0=v_main_~x~0_1154, main_~y~0=v_main_~y~0_822} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16068#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:42,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [178] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:42,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {16079#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [177] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1153 v_main_~x~0_1152))) (or .cse0 (and (< v_main_~x~0_1152 500001) (< v_main_~x~0_1153 v_main_~x~0_1152)) (and (not (< v_main_~x~0_1153 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1153} OutVars{main_~x~0=v_main_~x~0_1152} AuxVars[] AssignedVars[main_~x~0] {16072#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:42,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {15996#true} ~x~0 := 0;~y~0 := 500000; {16079#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:57:42,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {15996#true} call #t~ret4 := main(); {15996#true} is VALID [2022-04-15 06:57:42,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15996#true} {15996#true} #41#return; {15996#true} is VALID [2022-04-15 06:57:42,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {15996#true} assume true; {15996#true} is VALID [2022-04-15 06:57:42,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {15996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15996#true} is VALID [2022-04-15 06:57:42,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {15996#true} call ULTIMATE.init(); {15996#true} is VALID [2022-04-15 06:57:42,523 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:57:42,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909818044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:42,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:42,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:44,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:44,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643615469] [2022-04-15 06:57:44,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643615469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:44,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:44,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:57:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170860994] [2022-04-15 06:57:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:44,005 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 06:57:44,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:44,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:44,067 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:57:44,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:57:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:57:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:57:44,067 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:48,041 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-04-15 06:57:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:57:48,041 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 06:57:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-15 06:57:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 97 transitions. [2022-04-15 06:57:48,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 97 transitions. [2022-04-15 06:57:48,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:48,123 INFO L225 Difference]: With dead ends: 92 [2022-04-15 06:57:48,123 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 06:57:48,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=756, Invalid=7076, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:57:48,124 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:48,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 78 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:57:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 06:57:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 06:57:48,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:48,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,334 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,334 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:48,349 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-15 06:57:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:57:48,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:48,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:48,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:57:48,350 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:57:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:48,350 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-15 06:57:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:57:48,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:48,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:48,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:48,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-15 06:57:48,351 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 81 [2022-04-15 06:57:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:48,351 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-15 06:57:48,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:48,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-15 06:57:48,439 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:57:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:57:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 06:57:48,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:48,440 INFO L499 BasicCegarLoop]: trace histogram [36, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:48,465 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:57:48,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 06:57:48,641 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash -385546477, now seen corresponding path program 34 times [2022-04-15 06:57:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:48,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365836748] [2022-04-15 06:57:52,706 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:52,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:52,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:52,972 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -481243985, now seen corresponding path program 1 times [2022-04-15 06:57:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:52,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533195293] [2022-04-15 06:57:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:53,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {16742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:53,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {16742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-15 06:57:53,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-15 06:57:53,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16736#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:53,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {16736#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:53,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:57:53,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {16737#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16738#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:53,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {16738#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:53,055 INFO L272 TraceCheckUtils]: 10: Hoare triple {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:57:53,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {16740#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16741#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:53,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {16741#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16732#false} is VALID [2022-04-15 06:57:53,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-15 06:57:53,056 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:57:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:53,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533195293] [2022-04-15 06:57:53,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533195293] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:53,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882402676] [2022-04-15 06:57:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:53,057 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:57:53,059 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:57:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:53,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:53,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:53,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16731#true} is VALID [2022-04-15 06:57:53,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-15 06:57:53,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-15 06:57:53,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-15 06:57:53,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-15 06:57:53,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16761#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:57:53,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {16761#(and (<= main_~x~0 0) (= main_~y~0 500000))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:53,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:57:53,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {16765#(and (= main_~y~0 500000) (< main_~x~0 500001))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16772#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:57:53,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {16772#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:57:53,455 INFO L272 TraceCheckUtils]: 10: Hoare triple {16776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:53,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16784#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:53,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {16784#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16732#false} is VALID [2022-04-15 06:57:53,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-15 06:57:53,456 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:57:53,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:53,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {16732#false} assume !false; {16732#false} is VALID [2022-04-15 06:57:53,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {16784#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16732#false} is VALID [2022-04-15 06:57:53,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16784#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:57:53,795 INFO L272 TraceCheckUtils]: 10: Hoare triple {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {16780#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:53,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {16803#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [180] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {16739#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:57:53,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [183] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_865 v_main_~y~0_864)) (.cse2 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse0 (<= 500000 v_main_~x~0_1207))) (or (and (< v_main_~x~0_1206 1000001) (= (+ v_main_~x~0_1206 v_main_~y~0_865) (+ v_main_~x~0_1207 v_main_~y~0_864)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_1207 1000000)))))) InVars {main_~x~0=v_main_~x~0_1207, main_~y~0=v_main_~y~0_865} OutVars{main_~x~0=v_main_~x~0_1206, main_~y~0=v_main_~y~0_864} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {16803#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:53,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [182] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:53,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {16814#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [181] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1205 v_main_~x~0_1204))) (or (and (< v_main_~x~0_1204 500001) (< v_main_~x~0_1205 v_main_~x~0_1204)) (and (not (< v_main_~x~0_1205 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1205} OutVars{main_~x~0=v_main_~x~0_1204} AuxVars[] AssignedVars[main_~x~0] {16807#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:53,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {16731#true} ~x~0 := 0;~y~0 := 500000; {16814#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:57:53,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {16731#true} call #t~ret4 := main(); {16731#true} is VALID [2022-04-15 06:57:53,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16731#true} {16731#true} #41#return; {16731#true} is VALID [2022-04-15 06:57:53,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {16731#true} assume true; {16731#true} is VALID [2022-04-15 06:57:53,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {16731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16731#true} is VALID [2022-04-15 06:57:53,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {16731#true} call ULTIMATE.init(); {16731#true} is VALID [2022-04-15 06:57:53,808 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:57:53,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882402676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:53,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:53,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:57:55,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:55,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365836748] [2022-04-15 06:57:55,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365836748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:55,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:55,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:57:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193551275] [2022-04-15 06:57:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:55,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:55,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:55,314 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:57:55,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:57:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:57:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2492, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:57:55,315 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:59,582 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-04-15 06:57:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:57:59,583 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-15 06:57:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 99 transitions. [2022-04-15 06:57:59,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 99 transitions. [2022-04-15 06:57:59,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:59,666 INFO L225 Difference]: With dead ends: 94 [2022-04-15 06:57:59,666 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 06:57:59,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=775, Invalid=7415, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:57:59,667 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:59,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 63 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:57:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 06:57:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 06:57:59,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:59,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:59,913 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:59,913 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:59,914 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-15 06:57:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-15 06:57:59,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:59,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:59,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 06:57:59,914 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 06:57:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:59,915 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-15 06:57:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-15 06:57:59,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:59,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:59,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:59,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-04-15 06:57:59,916 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 83 [2022-04-15 06:57:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:59,916 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-04-15 06:57:59,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 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:57:59,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 90 transitions. [2022-04-15 06:57:59,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-15 06:57:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 06:57:59,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:59,997 INFO L499 BasicCegarLoop]: trace histogram [37, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:00,029 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:58:00,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:58:00,197 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -906544082, now seen corresponding path program 35 times [2022-04-15 06:58:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1911945913] [2022-04-15 06:58:00,285 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:00,531 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:00,532 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1568288175, now seen corresponding path program 1 times [2022-04-15 06:58:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:00,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751373319] [2022-04-15 06:58:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {17492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:00,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {17492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-15 06:58:00,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-15 06:58:00,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17486#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:00,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {17486#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:00,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:00,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {17487#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17488#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:00,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {17488#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:00,622 INFO L272 TraceCheckUtils]: 10: Hoare triple {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17490#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:00,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {17490#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17491#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:00,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {17491#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17482#false} is VALID [2022-04-15 06:58:00,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-15 06:58:00,623 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:58:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751373319] [2022-04-15 06:58:00,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751373319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114715315] [2022-04-15 06:58:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:00,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:00,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:00,624 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:58:00,626 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:58:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:00,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:00,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17481#true} is VALID [2022-04-15 06:58:00,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-15 06:58:00,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-15 06:58:00,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-15 06:58:00,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-15 06:58:00,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17511#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:00,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {17511#(and (<= main_~x~0 0) (= main_~y~0 500000))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:00,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:00,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {17515#(and (= main_~y~0 500000) (< main_~x~0 500001))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17522#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:00,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {17522#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17526#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:00,962 INFO L272 TraceCheckUtils]: 10: Hoare triple {17526#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:00,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17534#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:00,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {17534#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17482#false} is VALID [2022-04-15 06:58:00,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-15 06:58:00,962 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:58:00,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:01,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {17482#false} assume !false; {17482#false} is VALID [2022-04-15 06:58:01,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {17534#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17482#false} is VALID [2022-04-15 06:58:01,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17534#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:01,210 INFO L272 TraceCheckUtils]: 10: Hoare triple {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {17530#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:01,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {17553#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [184] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {17489#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:01,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [187] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_908 v_main_~y~0_907)) (.cse0 (<= 500000 v_main_~x~0_1260))) (or (and (or (not (< v_main_~x~0_1260 1000000)) (not .cse0)) .cse1 (= v_main_~x~0_1259 v_main_~x~0_1260)) (and (= v_main_~x~0_1260 v_main_~x~0_1259) .cse1) (let ((.cse2 (+ v_main_~x~0_1260 v_main_~y~0_907))) (and (< .cse2 (+ v_main_~y~0_908 1000001)) (< v_main_~y~0_908 v_main_~y~0_907) .cse0 (= (+ v_main_~x~0_1259 v_main_~y~0_908) .cse2))))) InVars {main_~x~0=v_main_~x~0_1260, main_~y~0=v_main_~y~0_908} OutVars{main_~x~0=v_main_~x~0_1259, main_~y~0=v_main_~y~0_907} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {17553#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:01,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [186] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:01,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {17564#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [185] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1258 v_main_~x~0_1257))) (or .cse0 (and (< v_main_~x~0_1258 v_main_~x~0_1257) (< v_main_~x~0_1257 500001)) (and .cse0 (<= 500000 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1258} OutVars{main_~x~0=v_main_~x~0_1257} AuxVars[] AssignedVars[main_~x~0] {17557#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:01,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {17481#true} ~x~0 := 0;~y~0 := 500000; {17564#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:01,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {17481#true} call #t~ret4 := main(); {17481#true} is VALID [2022-04-15 06:58:01,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17481#true} {17481#true} #41#return; {17481#true} is VALID [2022-04-15 06:58:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {17481#true} assume true; {17481#true} is VALID [2022-04-15 06:58:01,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17481#true} is VALID [2022-04-15 06:58:01,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {17481#true} call ULTIMATE.init(); {17481#true} is VALID [2022-04-15 06:58:01,214 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:58:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114715315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:01,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:01,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:02,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1911945913] [2022-04-15 06:58:02,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1911945913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:02,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:02,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:58:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856646984] [2022-04-15 06:58:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:02,524 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:58:02,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:02,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:02,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:02,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:58:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:58:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=2592, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:58:02,575 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:07,265 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-15 06:58:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:58:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:58:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-15 06:58:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-15 06:58:07,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 101 transitions. [2022-04-15 06:58:07,332 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:58:07,333 INFO L225 Difference]: With dead ends: 96 [2022-04-15 06:58:07,333 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 06:58:07,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=794, Invalid=7762, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:58:07,337 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:07,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 198 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:58:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 06:58:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 06:58:07,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:07,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,485 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,485 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:07,485 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-15 06:58:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-15 06:58:07,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:07,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:07,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 06:58:07,486 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 06:58:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:07,487 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-15 06:58:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-15 06:58:07,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:07,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:07,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:07,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-04-15 06:58:07,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 85 [2022-04-15 06:58:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:07,507 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-04-15 06:58:07,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 41 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:07,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 92 transitions. [2022-04-15 06:58:07,589 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:58:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-15 06:58:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 06:58:07,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:07,589 INFO L499 BasicCegarLoop]: trace histogram [38, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:07,619 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:58:07,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:58:07,790 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash 925931145, now seen corresponding path program 36 times [2022-04-15 06:58:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:07,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811799078] [2022-04-15 06:58:11,858 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:11,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:12,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:12,109 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash -677146961, now seen corresponding path program 1 times [2022-04-15 06:58:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:12,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631398119] [2022-04-15 06:58:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:12,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {18257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-15 06:58:12,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-15 06:58:12,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-15 06:58:12,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:12,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {18257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-15 06:58:12,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-15 06:58:12,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-15 06:58:12,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-15 06:58:12,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18251#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:12,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {18251#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:12,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:12,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {18252#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18253#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:58:12,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {18253#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:12,204 INFO L272 TraceCheckUtils]: 10: Hoare triple {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:12,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {18255#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:12,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {18256#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18247#false} is VALID [2022-04-15 06:58:12,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-15 06:58:12,204 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:58:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631398119] [2022-04-15 06:58:12,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631398119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492921243] [2022-04-15 06:58:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:12,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:12,210 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:58:12,211 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:58:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:12,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:12,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18246#true} is VALID [2022-04-15 06:58:12,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-15 06:58:12,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-15 06:58:12,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-15 06:58:12,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-15 06:58:12,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18276#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:12,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {18276#(and (<= main_~x~0 0) (= main_~y~0 500000))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:12,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:12,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {18280#(and (= main_~y~0 500000) (< main_~x~0 500001))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18287#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:12,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {18287#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18291#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:12,530 INFO L272 TraceCheckUtils]: 10: Hoare triple {18291#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:12,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:12,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18247#false} is VALID [2022-04-15 06:58:12,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-15 06:58:12,530 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:58:12,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:12,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {18247#false} assume !false; {18247#false} is VALID [2022-04-15 06:58:12,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18247#false} is VALID [2022-04-15 06:58:12,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:12,831 INFO L272 TraceCheckUtils]: 10: Hoare triple {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:12,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {18318#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [188] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {18254#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:12,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [191] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (<= 500000 v_main_~x~0_1314)) (.cse3 (= v_main_~x~0_1314 v_main_~x~0_1313))) (or (let ((.cse0 (+ v_main_~x~0_1314 v_main_~y~0_951))) (and (= (+ v_main_~x~0_1313 v_main_~y~0_952) .cse0) .cse1 (< v_main_~y~0_952 v_main_~y~0_951) (< .cse0 (+ v_main_~y~0_952 1000001)))) (and .cse2 .cse3) (and .cse2 (or (not (< v_main_~x~0_1314 1000000)) (not .cse1)) .cse3))) InVars {main_~x~0=v_main_~x~0_1314, main_~y~0=v_main_~y~0_952} OutVars{main_~x~0=v_main_~x~0_1313, main_~y~0=v_main_~y~0_951} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {18318#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:12,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [190] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:12,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {18329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [189] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1312 v_main_~x~0_1311))) (or (and (not (< v_main_~x~0_1312 500000)) .cse0) (and (< v_main_~x~0_1311 500001) (< v_main_~x~0_1312 v_main_~x~0_1311)) .cse0)) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1311} AuxVars[] AssignedVars[main_~x~0] {18322#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:12,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {18246#true} ~x~0 := 0;~y~0 := 500000; {18329#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:12,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {18246#true} call #t~ret4 := main(); {18246#true} is VALID [2022-04-15 06:58:12,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18246#true} {18246#true} #41#return; {18246#true} is VALID [2022-04-15 06:58:12,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {18246#true} assume true; {18246#true} is VALID [2022-04-15 06:58:12,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {18246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18246#true} is VALID [2022-04-15 06:58:12,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {18246#true} call ULTIMATE.init(); {18246#true} is VALID [2022-04-15 06:58:12,835 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:58:12,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492921243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:12,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:12,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:14,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811799078] [2022-04-15 06:58:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811799078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:14,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:14,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:58:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171085030] [2022-04-15 06:58:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-15 06:58:14,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:14,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:14,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:14,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:58:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:58:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=2694, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:58:14,373 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:19,024 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-15 06:58:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:58:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-15 06:58:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-15 06:58:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 103 transitions. [2022-04-15 06:58:19,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 103 transitions. [2022-04-15 06:58:19,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:19,111 INFO L225 Difference]: With dead ends: 98 [2022-04-15 06:58:19,111 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 06:58:19,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=813, Invalid=8117, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:58:19,112 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:19,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 98 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:58:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 06:58:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 06:58:19,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:19,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,285 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,285 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:19,286 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-15 06:58:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-15 06:58:19,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:19,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:19,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 06:58:19,287 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 06:58:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:19,287 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-15 06:58:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-15 06:58:19,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:19,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:19,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:19,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-04-15 06:58:19,289 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 87 [2022-04-15 06:58:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:19,289 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-04-15 06:58:19,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 42 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:19,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 94 transitions. [2022-04-15 06:58:19,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-15 06:58:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:58:19,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:19,411 INFO L499 BasicCegarLoop]: trace histogram [39, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:19,437 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:58:19,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:58:19,627 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 998032932, now seen corresponding path program 37 times [2022-04-15 06:58:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:19,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091133254] [2022-04-15 06:58:19,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:19,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:19,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1372385199, now seen corresponding path program 1 times [2022-04-15 06:58:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516270823] [2022-04-15 06:58:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {19037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:20,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {19037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-15 06:58:20,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19031#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:20,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {19031#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:20,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:20,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {19032#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19033#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {19033#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:20,013 INFO L272 TraceCheckUtils]: 10: Hoare triple {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:20,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {19035#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19036#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:20,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19027#false} is VALID [2022-04-15 06:58:20,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-15 06:58:20,013 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:58:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:20,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516270823] [2022-04-15 06:58:20,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516270823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:20,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855720511] [2022-04-15 06:58:20,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:20,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:20,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:20,032 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:58:20,038 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:58:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:20,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:20,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19026#true} is VALID [2022-04-15 06:58:20,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-15 06:58:20,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-15 06:58:20,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-15 06:58:20,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-15 06:58:20,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19056#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:20,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {19056#(and (<= main_~x~0 0) (= main_~y~0 500000))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:20,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:20,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {19060#(and (= main_~y~0 500000) (< main_~x~0 500001))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19067#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {19067#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19071#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:20,289 INFO L272 TraceCheckUtils]: 10: Hoare triple {19071#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:20,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19079#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:20,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {19079#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19027#false} is VALID [2022-04-15 06:58:20,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-15 06:58:20,290 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:58:20,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:20,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {19027#false} assume !false; {19027#false} is VALID [2022-04-15 06:58:20,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {19079#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19027#false} is VALID [2022-04-15 06:58:20,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19079#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:20,507 INFO L272 TraceCheckUtils]: 10: Hoare triple {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19075#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:20,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {19098#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [192] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19034#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:20,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [195] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1369 v_main_~x~0_1368)) (.cse1 (= v_main_~y~0_997 v_main_~y~0_996)) (.cse2 (<= 500000 v_main_~x~0_1369))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_1369 1000000)) (not .cse2))) (and (< v_main_~x~0_1369 v_main_~x~0_1368) .cse2 (= (+ v_main_~x~0_1369 v_main_~y~0_996) (+ v_main_~x~0_1368 v_main_~y~0_997)) (< v_main_~x~0_1368 1000001)))) InVars {main_~x~0=v_main_~x~0_1369, main_~y~0=v_main_~y~0_997} OutVars{main_~x~0=v_main_~x~0_1368, main_~y~0=v_main_~y~0_996} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19098#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [194] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {19109#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [193] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1367 v_main_~x~0_1366))) (or (and (< v_main_~x~0_1367 v_main_~x~0_1366) (< v_main_~x~0_1366 500001)) .cse0 (and .cse0 (<= 500000 v_main_~x~0_1367)))) InVars {main_~x~0=v_main_~x~0_1367} OutVars{main_~x~0=v_main_~x~0_1366} AuxVars[] AssignedVars[main_~x~0] {19102#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {19026#true} ~x~0 := 0;~y~0 := 500000; {19109#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:20,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {19026#true} call #t~ret4 := main(); {19026#true} is VALID [2022-04-15 06:58:20,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19026#true} {19026#true} #41#return; {19026#true} is VALID [2022-04-15 06:58:20,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {19026#true} assume true; {19026#true} is VALID [2022-04-15 06:58:20,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {19026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19026#true} is VALID [2022-04-15 06:58:20,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {19026#true} call ULTIMATE.init(); {19026#true} is VALID [2022-04-15 06:58:20,509 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:58:20,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855720511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:20,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:20,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:22,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:22,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091133254] [2022-04-15 06:58:22,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091133254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:22,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:22,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 06:58:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362939423] [2022-04-15 06:58:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:22,086 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:22,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:22,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:22,153 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:58:22,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 06:58:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 06:58:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=2798, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:58:22,154 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,704 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-04-15 06:58:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:58:27,705 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-15 06:58:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 105 transitions. [2022-04-15 06:58:27,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 105 transitions. [2022-04-15 06:58:27,792 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:58:27,793 INFO L225 Difference]: With dead ends: 100 [2022-04-15 06:58:27,793 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 06:58:27,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=832, Invalid=8480, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 06:58:27,794 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3130 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:27,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 38 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3130 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:58:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 06:58:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-15 06:58:28,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:28,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:28,052 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:28,052 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:28,053 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-15 06:58:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-15 06:58:28,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:28,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:28,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 06:58:28,053 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-15 06:58:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:28,054 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-15 06:58:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-15 06:58:28,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:28,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:28,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:28,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-15 06:58:28,055 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 89 [2022-04-15 06:58:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:28,055 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-15 06:58:28,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 43 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:58:28,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 96 transitions. [2022-04-15 06:58:28,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-15 06:58:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 06:58:28,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:28,144 INFO L499 BasicCegarLoop]: trace histogram [40, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:28,170 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:58:28,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:58:28,344 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1568373503, now seen corresponding path program 38 times [2022-04-15 06:58:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789067780] [2022-04-15 06:58:28,428 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:28,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:28,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash -873049937, now seen corresponding path program 1 times [2022-04-15 06:58:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:28,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71981905] [2022-04-15 06:58:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {19832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-15 06:58:28,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-15 06:58:28,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-15 06:58:28,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:28,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {19832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-15 06:58:28,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-15 06:58:28,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-15 06:58:28,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-15 06:58:28,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19826#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:28,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {19826#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:28,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:28,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {19827#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19828#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:28,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {19828#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:28,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19830#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:28,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {19830#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19831#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:28,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {19831#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19822#false} is VALID [2022-04-15 06:58:28,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-15 06:58:28,740 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:58:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71981905] [2022-04-15 06:58:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71981905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831243522] [2022-04-15 06:58:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:28,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:28,741 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:58:28,745 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:58:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:29,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19821#true} is VALID [2022-04-15 06:58:29,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-15 06:58:29,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-15 06:58:29,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-15 06:58:29,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-15 06:58:29,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19851#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:29,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {19851#(and (<= main_~x~0 0) (= main_~y~0 500000))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:29,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:29,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {19855#(and (= main_~y~0 500000) (< main_~x~0 500001))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19862#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:29,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {19862#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19866#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:29,117 INFO L272 TraceCheckUtils]: 10: Hoare triple {19866#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:29,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:29,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {19874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19822#false} is VALID [2022-04-15 06:58:29,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-15 06:58:29,118 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:58:29,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:29,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {19822#false} assume !false; {19822#false} is VALID [2022-04-15 06:58:29,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {19874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19822#false} is VALID [2022-04-15 06:58:29,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:29,432 INFO L272 TraceCheckUtils]: 10: Hoare triple {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {19870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:29,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {19893#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [196] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {19829#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:29,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [199] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1425 v_main_~x~0_1424)) (.cse2 (= v_main_~y~0_1043 v_main_~y~0_1042)) (.cse1 (<= 500000 v_main_~x~0_1425))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1425 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (+ v_main_~x~0_1425 v_main_~y~0_1042))) (and (< .cse3 (+ 1000001 v_main_~y~0_1043)) (= .cse3 (+ v_main_~x~0_1424 v_main_~y~0_1043)) .cse1 (< v_main_~y~0_1043 v_main_~y~0_1042))))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_1043} OutVars{main_~x~0=v_main_~x~0_1424, main_~y~0=v_main_~y~0_1042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {19893#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:29,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [198] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:29,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {19904#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [197] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1423 v_main_~x~0_1422))) (or (and (not (< v_main_~x~0_1423 500000)) .cse0) .cse0 (and (< v_main_~x~0_1422 500001) (< v_main_~x~0_1423 v_main_~x~0_1422)))) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1422} AuxVars[] AssignedVars[main_~x~0] {19897#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:29,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {19821#true} ~x~0 := 0;~y~0 := 500000; {19904#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:29,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {19821#true} call #t~ret4 := main(); {19821#true} is VALID [2022-04-15 06:58:29,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19821#true} {19821#true} #41#return; {19821#true} is VALID [2022-04-15 06:58:29,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {19821#true} assume true; {19821#true} is VALID [2022-04-15 06:58:29,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {19821#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19821#true} is VALID [2022-04-15 06:58:29,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {19821#true} call ULTIMATE.init(); {19821#true} is VALID [2022-04-15 06:58:29,438 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:58:29,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831243522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:29,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:29,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:30,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789067780] [2022-04-15 06:58:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789067780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:30,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:30,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:58:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954778802] [2022-04-15 06:58:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 06:58:30,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:30,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:30,815 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:58:30,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:58:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:58:30,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2904, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:58:30,816 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:36,924 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-04-15 06:58:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:58:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-15 06:58:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-15 06:58:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 107 transitions. [2022-04-15 06:58:36,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 107 transitions. [2022-04-15 06:58:36,983 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:58:36,984 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:58:36,984 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:58:36,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=851, Invalid=8851, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:58:36,985 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3481 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:36,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 158 Invalid, 3566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3481 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:58:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:58:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-15 06:58:37,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:37,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:37,152 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:37,152 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:37,153 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:58:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:58:37,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:37,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:37,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:58:37,154 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 06:58:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:37,154 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:58:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:58:37,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:37,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:37,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:37,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-15 06:58:37,155 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 91 [2022-04-15 06:58:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:37,156 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-15 06:58:37,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 44 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:37,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-15 06:58:37,239 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:58:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:58:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 06:58:37,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:37,240 INFO L499 BasicCegarLoop]: trace histogram [41, 39, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:37,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:58:37,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-15 06:58:37,440 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:37,440 INFO L85 PathProgramCache]: Analyzing trace with hash -90151654, now seen corresponding path program 39 times [2022-04-15 06:58:37,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:37,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606892169] [2022-04-15 06:58:38,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:42,373 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:42,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:42,493 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1176482223, now seen corresponding path program 1 times [2022-04-15 06:58:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:42,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594413022] [2022-04-15 06:58:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:42,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {20642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-15 06:58:42,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-15 06:58:42,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-15 06:58:42,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:42,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {20642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-15 06:58:42,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-15 06:58:42,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-15 06:58:42,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-15 06:58:42,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20636#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:42,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {20636#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:42,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:42,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {20637#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20638#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:42,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {20638#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:42,587 INFO L272 TraceCheckUtils]: 10: Hoare triple {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20640#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:42,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {20640#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20641#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:42,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {20641#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20632#false} is VALID [2022-04-15 06:58:42,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-15 06:58:42,588 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:58:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:42,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594413022] [2022-04-15 06:58:42,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594413022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:42,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825711542] [2022-04-15 06:58:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:42,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:42,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:42,589 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:58:42,590 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:58:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:42,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:42,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:42,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20631#true} is VALID [2022-04-15 06:58:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-15 06:58:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-15 06:58:42,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-15 06:58:42,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-15 06:58:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20661#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:42,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {20661#(and (<= main_~x~0 0) (= main_~y~0 500000))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:43,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:43,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {20665#(and (= main_~y~0 500000) (< main_~x~0 500001))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20672#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:43,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {20672#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20676#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:43,002 INFO L272 TraceCheckUtils]: 10: Hoare triple {20676#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:43,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:43,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {20684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20632#false} is VALID [2022-04-15 06:58:43,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-15 06:58:43,016 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:58:43,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:43,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {20632#false} assume !false; {20632#false} is VALID [2022-04-15 06:58:43,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {20684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20632#false} is VALID [2022-04-15 06:58:43,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:43,365 INFO L272 TraceCheckUtils]: 10: Hoare triple {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {20680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:43,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {20703#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [200] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {20639#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:43,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [203] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1482)) (.cse0 (= v_main_~x~0_1482 v_main_~x~0_1481))) (or (and (= v_main_~y~0_1090 v_main_~y~0_1089) .cse0) (and .cse1 (< v_main_~x~0_1481 1000001) (< v_main_~x~0_1482 v_main_~x~0_1481) (= (+ v_main_~x~0_1482 v_main_~y~0_1089) (+ v_main_~x~0_1481 v_main_~y~0_1090))) (and (or (not (< v_main_~x~0_1482 1000000)) (not .cse1)) (= v_main_~y~0_1089 v_main_~y~0_1090) .cse0))) InVars {main_~x~0=v_main_~x~0_1482, main_~y~0=v_main_~y~0_1090} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_1089} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {20703#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:43,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [202] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:43,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {20714#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [201] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_1480 v_main_~x~0_1479) (and (<= 500000 v_main_~x~0_1480) (= v_main_~x~0_1479 v_main_~x~0_1480)) (and (< v_main_~x~0_1480 v_main_~x~0_1479) (< v_main_~x~0_1479 500001))) InVars {main_~x~0=v_main_~x~0_1480} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[main_~x~0] {20707#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:43,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {20631#true} ~x~0 := 0;~y~0 := 500000; {20714#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:43,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {20631#true} call #t~ret4 := main(); {20631#true} is VALID [2022-04-15 06:58:43,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20631#true} {20631#true} #41#return; {20631#true} is VALID [2022-04-15 06:58:43,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {20631#true} assume true; {20631#true} is VALID [2022-04-15 06:58:43,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {20631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20631#true} is VALID [2022-04-15 06:58:43,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {20631#true} call ULTIMATE.init(); {20631#true} is VALID [2022-04-15 06:58:43,368 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:58:43,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825711542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:43,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:43,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:44,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:44,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606892169] [2022-04-15 06:58:44,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606892169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:44,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:44,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 06:58:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799206326] [2022-04-15 06:58:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 06:58:44,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:44,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:44,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:44,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 06:58:44,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:44,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 06:58:44,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3012, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:58:44,910 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:50,670 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-04-15 06:58:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:58:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 06:58:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-15 06:58:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-04-15 06:58:50,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 109 transitions. [2022-04-15 06:58:50,730 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:58:50,731 INFO L225 Difference]: With dead ends: 104 [2022-04-15 06:58:50,731 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 06:58:50,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=870, Invalid=9230, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 06:58:50,733 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:50,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 128 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:58:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 06:58:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-15 06:58:50,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:50,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,912 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,912 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:50,913 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-04-15 06:58:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-15 06:58:50,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:50,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:50,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-15 06:58:50,913 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-15 06:58:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:50,914 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2022-04-15 06:58:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-15 06:58:50,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:50,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:50,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:50,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-04-15 06:58:50,915 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 93 [2022-04-15 06:58:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:50,915 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-04-15 06:58:50,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.934782608695652) internal successors, (89), 45 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:50,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 100 transitions. [2022-04-15 06:58:51,041 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:58:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-15 06:58:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 06:58:51,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:51,042 INFO L499 BasicCegarLoop]: trace histogram [42, 40, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:51,069 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:58:51,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 06:58:51,267 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -499960715, now seen corresponding path program 40 times [2022-04-15 06:58:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:51,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677122702] [2022-04-15 06:58:51,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:55,597 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:55,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:55,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1068952913, now seen corresponding path program 1 times [2022-04-15 06:58:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:55,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747699342] [2022-04-15 06:58:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:55,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {21467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-15 06:58:55,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-15 06:58:55,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-15 06:58:55,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:55,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {21467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-15 06:58:55,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-15 06:58:55,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-15 06:58:55,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-15 06:58:55,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21461#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:58:55,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {21461#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:55,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:58:55,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {21462#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21463#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:55,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {21463#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:55,793 INFO L272 TraceCheckUtils]: 10: Hoare triple {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21465#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:58:55,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {21465#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21466#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:55,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {21466#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21457#false} is VALID [2022-04-15 06:58:55,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-15 06:58:55,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:58:55,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747699342] [2022-04-15 06:58:55,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747699342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974845782] [2022-04-15 06:58:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:55,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:55,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:55,795 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:58:55,795 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:58:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:55,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:55,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:56,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21456#true} is VALID [2022-04-15 06:58:56,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-15 06:58:56,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-15 06:58:56,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-15 06:58:56,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-15 06:58:56,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21486#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:58:56,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {21486#(and (<= main_~x~0 0) (= main_~y~0 500000))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:56,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:58:56,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {21490#(and (= main_~y~0 500000) (< main_~x~0 500001))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21497#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:56,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {21497#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21501#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:56,195 INFO L272 TraceCheckUtils]: 10: Hoare triple {21501#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:56,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:56,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {21509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21457#false} is VALID [2022-04-15 06:58:56,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-15 06:58:56,196 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:58:56,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:56,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {21457#false} assume !false; {21457#false} is VALID [2022-04-15 06:58:56,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {21509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21457#false} is VALID [2022-04-15 06:58:56,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:58:56,509 INFO L272 TraceCheckUtils]: 10: Hoare triple {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {21505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:56,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {21528#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [204] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {21464#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:58:56,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [207] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1138 v_main_~y~0_1137)) (.cse2 (<= 500000 v_main_~x~0_1540))) (or (and .cse0 (= v_main_~x~0_1540 v_main_~x~0_1539)) (let ((.cse1 (+ v_main_~x~0_1540 v_main_~y~0_1137))) (and (< .cse1 (+ 1000001 v_main_~y~0_1138)) .cse2 (< v_main_~y~0_1138 v_main_~y~0_1137) (= (+ v_main_~x~0_1539 v_main_~y~0_1138) .cse1))) (and .cse0 (= v_main_~x~0_1539 v_main_~x~0_1540) (or (not .cse2) (not (< v_main_~x~0_1540 1000000)))))) InVars {main_~x~0=v_main_~x~0_1540, main_~y~0=v_main_~y~0_1138} OutVars{main_~x~0=v_main_~x~0_1539, main_~y~0=v_main_~y~0_1137} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21528#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:56,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [206] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:56,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {21539#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [205] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1538 v_main_~x~0_1537))) (or .cse0 (and (< v_main_~x~0_1538 v_main_~x~0_1537) (< v_main_~x~0_1537 500001)) (and .cse0 (not (< v_main_~x~0_1538 500000))))) InVars {main_~x~0=v_main_~x~0_1538} OutVars{main_~x~0=v_main_~x~0_1537} AuxVars[] AssignedVars[main_~x~0] {21532#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:56,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {21456#true} ~x~0 := 0;~y~0 := 500000; {21539#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:58:56,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {21456#true} call #t~ret4 := main(); {21456#true} is VALID [2022-04-15 06:58:56,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21456#true} {21456#true} #41#return; {21456#true} is VALID [2022-04-15 06:58:56,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {21456#true} assume true; {21456#true} is VALID [2022-04-15 06:58:56,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {21456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21456#true} is VALID [2022-04-15 06:58:56,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {21456#true} call ULTIMATE.init(); {21456#true} is VALID [2022-04-15 06:58:56,513 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:58:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974845782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:56,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:56,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:58:57,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:57,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677122702] [2022-04-15 06:58:57,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677122702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:57,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:57,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:58:57,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349662824] [2022-04-15 06:58:57,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:57,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:57,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:58:58,064 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:58:58,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:58:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:58,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:58:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3122, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:58:58,066 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:59:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:04,591 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-15 06:59:04,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:59:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:59:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:59:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-15 06:59:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:59:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 111 transitions. [2022-04-15 06:59:04,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 111 transitions. [2022-04-15 06:59:04,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:04,656 INFO L225 Difference]: With dead ends: 106 [2022-04-15 06:59:04,656 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 06:59:04,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=889, Invalid=9617, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:59:04,679 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:04,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 58 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3663 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:59:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 06:59:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-15 06:59:04,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:04,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:04,973 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:04,973 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:04,974 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-04-15 06:59:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-15 06:59:04,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:04,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:04,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 06:59:04,974 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 06:59:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:04,975 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2022-04-15 06:59:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-15 06:59:04,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:04,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:04,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:04,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2022-04-15 06:59:04,976 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 95 [2022-04-15 06:59:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:04,976 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2022-04-15 06:59:04,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 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:59:04,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 102 transitions. [2022-04-15 06:59:05,068 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:59:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2022-04-15 06:59:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 06:59:05,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:05,069 INFO L499 BasicCegarLoop]: trace histogram [43, 41, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:05,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:05,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 06:59:05,269 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 810522896, now seen corresponding path program 41 times [2022-04-15 06:59:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088715301] [2022-04-15 06:59:05,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:09,479 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:09,591 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:09,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash 980579247, now seen corresponding path program 1 times [2022-04-15 06:59:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:09,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834423501] [2022-04-15 06:59:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {22307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:09,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {22307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-15 06:59:09,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-15 06:59:09,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22301#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:09,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {22301#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:59:09,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:59:09,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {22302#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22303#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 06:59:09,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {22303#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:09,695 INFO L272 TraceCheckUtils]: 10: Hoare triple {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:59:09,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {22305#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {22306#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:09,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {22306#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22297#false} is VALID [2022-04-15 06:59:09,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-15 06:59:09,695 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:59:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:09,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834423501] [2022-04-15 06:59:09,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834423501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:09,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372469844] [2022-04-15 06:59:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:09,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:09,697 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:59:09,714 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:59:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:59:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:09,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:10,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22296#true} is VALID [2022-04-15 06:59:10,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-15 06:59:10,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-15 06:59:10,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-15 06:59:10,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-15 06:59:10,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22326#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:59:10,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {22326#(and (<= main_~x~0 0) (= main_~y~0 500000))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:10,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:10,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {22330#(and (= main_~y~0 500000) (< main_~x~0 500001))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22337#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:10,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {22337#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22341#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:10,127 INFO L272 TraceCheckUtils]: 10: Hoare triple {22341#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:10,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:10,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {22349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22297#false} is VALID [2022-04-15 06:59:10,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-15 06:59:10,127 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:59:10,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:10,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {22297#false} assume !false; {22297#false} is VALID [2022-04-15 06:59:10,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {22349#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22297#false} is VALID [2022-04-15 06:59:10,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22349#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:10,479 INFO L272 TraceCheckUtils]: 10: Hoare triple {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {22345#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:10,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {22368#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [208] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {22304#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:10,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [211] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1599)) (.cse0 (= v_main_~x~0_1599 v_main_~x~0_1598)) (.cse1 (= v_main_~y~0_1187 v_main_~y~0_1186))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~x~0_1599 v_main_~y~0_1186))) (and (= (+ v_main_~x~0_1598 v_main_~y~0_1187) .cse2) (< v_main_~y~0_1187 v_main_~y~0_1186) (< .cse2 (+ 1000001 v_main_~y~0_1187)) .cse3)) (and (or (not .cse3) (not (< v_main_~x~0_1599 1000000))) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1599, main_~y~0=v_main_~y~0_1187} OutVars{main_~x~0=v_main_~x~0_1598, main_~y~0=v_main_~y~0_1186} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {22368#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:10,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [210] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:10,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {22379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [209] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1597 v_main_~x~0_1596))) (or (and .cse0 (not (< v_main_~x~0_1597 500000))) .cse0 (and (< v_main_~x~0_1597 v_main_~x~0_1596) (< v_main_~x~0_1596 500001)))) InVars {main_~x~0=v_main_~x~0_1597} OutVars{main_~x~0=v_main_~x~0_1596} AuxVars[] AssignedVars[main_~x~0] {22372#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:10,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {22296#true} ~x~0 := 0;~y~0 := 500000; {22379#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:10,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {22296#true} call #t~ret4 := main(); {22296#true} is VALID [2022-04-15 06:59:10,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22296#true} {22296#true} #41#return; {22296#true} is VALID [2022-04-15 06:59:10,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {22296#true} assume true; {22296#true} is VALID [2022-04-15 06:59:10,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {22296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22296#true} is VALID [2022-04-15 06:59:10,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {22296#true} call ULTIMATE.init(); {22296#true} is VALID [2022-04-15 06:59:10,482 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:59:10,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372469844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:10,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:10,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:59:12,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:12,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088715301] [2022-04-15 06:59:12,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088715301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:12,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:12,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:59:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203792498] [2022-04-15 06:59:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:12,233 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:59:12,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:12,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:12,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:12,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:59:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:59:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=3234, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:59:12,308 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:19,043 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-15 06:59:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:59:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:59:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-15 06:59:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 113 transitions. [2022-04-15 06:59:19,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 113 transitions. [2022-04-15 06:59:19,105 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:59:19,106 INFO L225 Difference]: With dead ends: 108 [2022-04-15 06:59:19,106 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 06:59:19,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=908, Invalid=10012, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:59:19,107 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:19,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:59:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 06:59:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-15 06:59:19,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:19,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,284 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,284 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:19,285 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-15 06:59:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-15 06:59:19,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:19,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:19,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 06:59:19,285 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 06:59:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:19,286 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-15 06:59:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-15 06:59:19,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:19,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:19,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:19,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-04-15 06:59:19,287 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 97 [2022-04-15 06:59:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:19,288 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-04-15 06:59:19,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.9375) internal successors, (93), 47 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:19,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2022-04-15 06:59:19,374 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:59:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-15 06:59:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 06:59:19,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:19,374 INFO L499 BasicCegarLoop]: trace histogram [44, 42, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:19,393 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:59:19,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:19,575 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1759855339, now seen corresponding path program 42 times [2022-04-15 06:59:19,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:19,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050035203] [2022-04-15 06:59:19,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:19,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:19,818 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1264855889, now seen corresponding path program 1 times [2022-04-15 06:59:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:19,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667994837] [2022-04-15 06:59:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:19,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {23162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:19,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {23162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-15 06:59:19,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23156#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:19,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {23156#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:59:19,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 06:59:19,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {23157#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23158#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:59:19,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {23158#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:59:19,911 INFO L272 TraceCheckUtils]: 10: Hoare triple {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:59:19,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {23160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:19,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {23161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23152#false} is VALID [2022-04-15 06:59:19,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-15 06:59:19,911 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:59:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667994837] [2022-04-15 06:59:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667994837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746383184] [2022-04-15 06:59:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:19,913 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:59:19,914 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:59:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:59:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:19,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:20,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23151#true} is VALID [2022-04-15 06:59:20,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-15 06:59:20,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-15 06:59:20,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-15 06:59:20,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-15 06:59:20,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23181#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:59:20,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {23181#(and (<= main_~x~0 0) (= main_~y~0 500000))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:20,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:20,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {23185#(and (= main_~y~0 500000) (< main_~x~0 500001))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23192#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:20,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {23192#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23196#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:20,350 INFO L272 TraceCheckUtils]: 10: Hoare triple {23196#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:20,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:20,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {23204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23152#false} is VALID [2022-04-15 06:59:20,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-15 06:59:20,351 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:59:20,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:20,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {23152#false} assume !false; {23152#false} is VALID [2022-04-15 06:59:20,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {23204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23152#false} is VALID [2022-04-15 06:59:20,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:20,671 INFO L272 TraceCheckUtils]: 10: Hoare triple {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {23200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:20,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {23223#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [212] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {23159#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 06:59:20,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [215] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1659 v_main_~x~0_1658)) (.cse2 (= v_main_~y~0_1237 v_main_~y~0_1236)) (.cse0 (<= 500000 v_main_~x~0_1659))) (or (and (< v_main_~x~0_1658 1000001) (= (+ v_main_~x~0_1659 v_main_~y~0_1236) (+ v_main_~x~0_1658 v_main_~y~0_1237)) (< v_main_~x~0_1659 v_main_~x~0_1658) .cse0) (and .cse1 .cse2) (and .cse1 .cse2 (or (not (< v_main_~x~0_1659 1000000)) (not .cse0))))) InVars {main_~x~0=v_main_~x~0_1659, main_~y~0=v_main_~y~0_1237} OutVars{main_~x~0=v_main_~x~0_1658, main_~y~0=v_main_~y~0_1236} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23223#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:59:20,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [214] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:59:20,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {23234#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [213] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1657 v_main_~x~0_1656))) (or (and (<= 500000 v_main_~x~0_1657) .cse0) (and (< v_main_~x~0_1656 500001) (< v_main_~x~0_1657 v_main_~x~0_1656)) .cse0)) InVars {main_~x~0=v_main_~x~0_1657} OutVars{main_~x~0=v_main_~x~0_1656} AuxVars[] AssignedVars[main_~x~0] {23227#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 06:59:20,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#true} ~x~0 := 0;~y~0 := 500000; {23234#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-15 06:59:20,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#true} call #t~ret4 := main(); {23151#true} is VALID [2022-04-15 06:59:20,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#true} {23151#true} #41#return; {23151#true} is VALID [2022-04-15 06:59:20,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#true} assume true; {23151#true} is VALID [2022-04-15 06:59:20,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {23151#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23151#true} is VALID [2022-04-15 06:59:20,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {23151#true} call ULTIMATE.init(); {23151#true} is VALID [2022-04-15 06:59:20,674 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:59:20,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746383184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:20,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:20,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:59:22,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050035203] [2022-04-15 06:59:22,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050035203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:22,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:22,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:59:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552306614] [2022-04-15 06:59:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 06:59:22,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:22,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:22,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:22,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:59:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:59:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3348, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:59:22,449 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:29,012 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-04-15 06:59:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:59:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 06:59:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-15 06:59:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 115 transitions. [2022-04-15 06:59:29,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 115 transitions. [2022-04-15 06:59:29,080 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:59:29,081 INFO L225 Difference]: With dead ends: 110 [2022-04-15 06:59:29,081 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 06:59:29,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=927, Invalid=10415, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:59:29,082 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4215 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:29,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 188 Invalid, 4308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4215 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 06:59:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 06:59:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 06:59:29,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:29,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,258 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,258 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:29,259 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-15 06:59:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-15 06:59:29,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:29,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:29,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 06:59:29,260 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 06:59:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:29,260 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-04-15 06:59:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-15 06:59:29,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:29,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:29,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:29,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2022-04-15 06:59:29,262 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 99 [2022-04-15 06:59:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:29,262 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-04-15 06:59:29,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 48 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2022-04-15 06:59:29,332 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:59:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-15 06:59:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 06:59:29,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:29,332 INFO L499 BasicCegarLoop]: trace histogram [45, 43, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:29,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:29,548 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -759700986, now seen corresponding path program 43 times [2022-04-15 06:59:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:29,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158592178] [2022-04-15 06:59:33,629 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:33,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:33,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:33,807 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 784676271, now seen corresponding path program 1 times [2022-04-15 06:59:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:33,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962957550] [2022-04-15 06:59:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:33,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {24032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:33,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {24032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-15 06:59:33,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-15 06:59:33,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24026#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:33,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {24026#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:33,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:33,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {24027#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:33,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:33,953 INFO L272 TraceCheckUtils]: 10: Hoare triple {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:59:33,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {24030#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24031#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:33,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {24031#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24022#false} is VALID [2022-04-15 06:59:33,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-15 06:59:33,954 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:59:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962957550] [2022-04-15 06:59:33,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962957550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:33,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148621678] [2022-04-15 06:59:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:33,956 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:59:33,956 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:59:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:33,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:59:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:33,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:34,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24021#true} is VALID [2022-04-15 06:59:34,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-15 06:59:34,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-15 06:59:34,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-15 06:59:34,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-15 06:59:34,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24051#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:59:34,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {24051#(and (<= main_~x~0 0) (= main_~y~0 500000))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:34,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:34,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {24055#(and (= main_~y~0 500000) (< main_~x~0 500001))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24062#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:34,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {24062#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24066#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:34,365 INFO L272 TraceCheckUtils]: 10: Hoare triple {24066#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:34,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:34,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {24074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24022#false} is VALID [2022-04-15 06:59:34,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-15 06:59:34,365 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:59:34,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:34,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {24022#false} assume !false; {24022#false} is VALID [2022-04-15 06:59:34,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {24074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24022#false} is VALID [2022-04-15 06:59:34,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:34,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:34,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [216] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24029#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:34,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [219] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1720)) (.cse0 (= v_main_~y~0_1288 v_main_~y~0_1287))) (or (and (= v_main_~x~0_1720 v_main_~x~0_1719) .cse0) (let ((.cse1 (+ v_main_~x~0_1720 v_main_~y~0_1287))) (and (< v_main_~y~0_1288 v_main_~y~0_1287) (< .cse1 (+ 1000001 v_main_~y~0_1288)) .cse2 (= .cse1 (+ v_main_~x~0_1719 v_main_~y~0_1288)))) (and (or (not .cse2) (not (< v_main_~x~0_1720 1000000))) (= v_main_~x~0_1719 v_main_~x~0_1720) .cse0))) InVars {main_~x~0=v_main_~x~0_1720, main_~y~0=v_main_~y~0_1288} OutVars{main_~x~0=v_main_~x~0_1719, main_~y~0=v_main_~y~0_1287} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24028#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:34,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [218] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:34,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {24103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [217] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1718 v_main_~x~0_1717))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_1718)) (and (< v_main_~x~0_1717 500001) (< v_main_~x~0_1718 v_main_~x~0_1717)))) InVars {main_~x~0=v_main_~x~0_1718} OutVars{main_~x~0=v_main_~x~0_1717} AuxVars[] AssignedVars[main_~x~0] {24096#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:34,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {24021#true} ~x~0 := 0;~y~0 := 500000; {24103#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:34,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {24021#true} call #t~ret4 := main(); {24021#true} is VALID [2022-04-15 06:59:34,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24021#true} {24021#true} #41#return; {24021#true} is VALID [2022-04-15 06:59:34,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {24021#true} assume true; {24021#true} is VALID [2022-04-15 06:59:34,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {24021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24021#true} is VALID [2022-04-15 06:59:34,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {24021#true} call ULTIMATE.init(); {24021#true} is VALID [2022-04-15 06:59:34,708 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:59:34,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148621678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:34,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:34,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 06:59:36,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158592178] [2022-04-15 06:59:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158592178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:36,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:36,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:59:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135789520] [2022-04-15 06:59:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:36,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:36,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:36,638 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:59:36,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:59:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:59:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3397, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:59:36,640 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:43,368 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-04-15 06:59:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:59:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-15 06:59:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-15 06:59:43,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 117 transitions. [2022-04-15 06:59:43,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:43,450 INFO L225 Difference]: With dead ends: 112 [2022-04-15 06:59:43,450 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 06:59:43,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=843, Invalid=10713, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 06:59:43,451 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4205 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 4205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:43,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 103 Invalid, 4300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 4205 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:59:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 06:59:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-15 06:59:43,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:43,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:43,654 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:43,654 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:43,654 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2022-04-15 06:59:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-15 06:59:43,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:43,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:43,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 06:59:43,662 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-15 06:59:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:43,663 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2022-04-15 06:59:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-15 06:59:43,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:43,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:43,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:43,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2022-04-15 06:59:43,664 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 101 [2022-04-15 06:59:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:43,665 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2022-04-15 06:59:43,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 49 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:59:43,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 108 transitions. [2022-04-15 06:59:43,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2022-04-15 06:59:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 06:59:43,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:43,762 INFO L499 BasicCegarLoop]: trace histogram [46, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:43,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:43,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 06:59:43,965 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 308225633, now seen corresponding path program 44 times [2022-04-15 06:59:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:43,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113717582] [2022-04-15 06:59:48,031 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:48,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:52,203 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:52,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:52,320 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1460758865, now seen corresponding path program 1 times [2022-04-15 06:59:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:52,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881075150] [2022-04-15 06:59:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {24916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-15 06:59:52,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:52,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {24916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-15 06:59:52,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24910#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:52,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {24910#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:52,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 06:59:52,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {24911#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24912#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:52,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {24912#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:52,417 INFO L272 TraceCheckUtils]: 10: Hoare triple {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24914#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:59:52,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {24914#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24915#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:52,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24906#false} is VALID [2022-04-15 06:59:52,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-15 06:59:52,418 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:59:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881075150] [2022-04-15 06:59:52,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881075150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987076727] [2022-04-15 06:59:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:52,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:52,419 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:59:52,421 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:59:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:59:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:52,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:52,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24905#true} is VALID [2022-04-15 06:59:52,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-15 06:59:52,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-15 06:59:52,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-15 06:59:52,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-15 06:59:52,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24935#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 06:59:52,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {24935#(and (<= main_~x~0 0) (= main_~y~0 500000))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:52,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 06:59:52,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {24939#(and (= main_~y~0 500000) (< main_~x~0 500001))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24946#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:52,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {24946#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24950#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:52,835 INFO L272 TraceCheckUtils]: 10: Hoare triple {24950#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:52,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:52,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {24958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24906#false} is VALID [2022-04-15 06:59:52,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-15 06:59:52,836 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:59:52,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:53,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#false} assume !false; {24906#false} is VALID [2022-04-15 06:59:53,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {24958#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24906#false} is VALID [2022-04-15 06:59:53,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24958#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:59:53,111 INFO L272 TraceCheckUtils]: 10: Hoare triple {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {24954#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:53,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {24977#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [220] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {24913#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 06:59:53,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [223] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1782)) (.cse1 (= v_main_~x~0_1782 v_main_~x~0_1781)) (.cse2 (= v_main_~y~0_1340 v_main_~y~0_1339))) (or (and (or (not .cse0) (not (< v_main_~x~0_1782 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_1782 v_main_~y~0_1339))) (and (< .cse3 (+ 1000001 v_main_~y~0_1340)) (= (+ v_main_~x~0_1781 v_main_~y~0_1340) .cse3) (< v_main_~y~0_1340 v_main_~y~0_1339) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_1782, main_~y~0=v_main_~y~0_1340} OutVars{main_~x~0=v_main_~x~0_1781, main_~y~0=v_main_~y~0_1339} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24977#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:53,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [222] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:53,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {24988#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [221] L11-2-->L10-2_primed: Formula: (or (and (< v_main_~x~0_1780 v_main_~x~0_1779) (< v_main_~x~0_1779 500001)) (= v_main_~x~0_1780 v_main_~x~0_1779) (and (not (< v_main_~x~0_1780 500000)) (= v_main_~x~0_1779 v_main_~x~0_1780))) InVars {main_~x~0=v_main_~x~0_1780} OutVars{main_~x~0=v_main_~x~0_1779} AuxVars[] AssignedVars[main_~x~0] {24981#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:53,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {24905#true} ~x~0 := 0;~y~0 := 500000; {24988#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:59:53,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {24905#true} call #t~ret4 := main(); {24905#true} is VALID [2022-04-15 06:59:53,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24905#true} {24905#true} #41#return; {24905#true} is VALID [2022-04-15 06:59:53,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {24905#true} assume true; {24905#true} is VALID [2022-04-15 06:59:53,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {24905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24905#true} is VALID [2022-04-15 06:59:53,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {24905#true} call ULTIMATE.init(); {24905#true} is VALID [2022-04-15 06:59:53,114 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:59:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987076727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:53,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:53,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 06:59:55,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:55,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113717582] [2022-04-15 06:59:55,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113717582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:55,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:55,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:59:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682380943] [2022-04-15 06:59:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 06:59:55,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:55,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:55,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:59:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:59:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3582, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:59:55,227 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:02,495 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-04-15 07:00:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 07:00:02,496 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-15 07:00:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-15 07:00:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 119 transitions. [2022-04-15 07:00:02,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 119 transitions. [2022-04-15 07:00:02,569 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 07:00:02,581 INFO L225 Difference]: With dead ends: 114 [2022-04-15 07:00:02,581 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 07:00:02,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=965, Invalid=11245, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 07:00:02,583 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4353 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:02,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 4450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4353 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 07:00:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 07:00:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-15 07:00:02,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:02,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,799 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,799 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:02,800 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 07:00:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 07:00:02,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:02,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:02,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 07:00:02,801 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 07:00:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:02,801 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 07:00:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 07:00:02,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:02,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:02,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:02,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-04-15 07:00:02,803 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 103 [2022-04-15 07:00:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:02,803 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-04-15 07:00:02,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:02,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 110 transitions. [2022-04-15 07:00:02,903 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 07:00:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 07:00:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 07:00:02,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:02,904 INFO L499 BasicCegarLoop]: trace histogram [47, 45, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:02,923 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 07:00:03,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-15 07:00:03,105 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 88522748, now seen corresponding path program 45 times [2022-04-15 07:00:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:03,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524153458] [2022-04-15 07:00:03,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:03,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:03,379 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 588773295, now seen corresponding path program 1 times [2022-04-15 07:00:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693748733] [2022-04-15 07:00:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:03,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:03,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {25816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:03,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {25816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-15 07:00:03,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25810#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:03,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {25810#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:03,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:03,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {25811#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25812#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 07:00:03,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {25812#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:03,447 INFO L272 TraceCheckUtils]: 10: Hoare triple {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:00:03,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {25814#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25815#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:03,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {25815#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25806#false} is VALID [2022-04-15 07:00:03,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-15 07:00:03,447 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 07:00:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693748733] [2022-04-15 07:00:03,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693748733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:03,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021933653] [2022-04-15 07:00:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:03,459 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 07:00:03,472 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 07:00:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:03,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:00:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:03,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:03,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25805#true} is VALID [2022-04-15 07:00:03,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-15 07:00:03,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-15 07:00:03,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-15 07:00:03,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-15 07:00:03,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25835#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:00:03,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {25835#(and (<= main_~x~0 0) (= main_~y~0 500000))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:03,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:03,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {25839#(and (= main_~y~0 500000) (< main_~x~0 500001))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25846#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:03,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {25846#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25850#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:03,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {25850#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:03,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:03,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {25858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25806#false} is VALID [2022-04-15 07:00:03,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-15 07:00:03,740 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 07:00:03,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:04,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {25806#false} assume !false; {25806#false} is VALID [2022-04-15 07:00:04,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {25858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25806#false} is VALID [2022-04-15 07:00:04,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:04,046 INFO L272 TraceCheckUtils]: 10: Hoare triple {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {25854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:04,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {25877#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [224] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {25813#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:04,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [227] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1845 v_main_~x~0_1844)) (.cse1 (= v_main_~y~0_1393 v_main_~y~0_1392)) (.cse2 (<= 500000 v_main_~x~0_1845))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_1845 1000000))) .cse1) (let ((.cse3 (+ v_main_~x~0_1845 v_main_~y~0_1392))) (and (< v_main_~y~0_1393 v_main_~y~0_1392) .cse2 (= .cse3 (+ v_main_~x~0_1844 v_main_~y~0_1393)) (< .cse3 (+ 1000001 v_main_~y~0_1393)))))) InVars {main_~x~0=v_main_~x~0_1845, main_~y~0=v_main_~y~0_1393} OutVars{main_~x~0=v_main_~x~0_1844, main_~y~0=v_main_~y~0_1392} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {25877#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:04,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [226] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:04,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {25888#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [225] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1843 v_main_~x~0_1842))) (or .cse0 (and (< v_main_~x~0_1842 500001) (< v_main_~x~0_1843 v_main_~x~0_1842)) (and (not (< v_main_~x~0_1843 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1843} OutVars{main_~x~0=v_main_~x~0_1842} AuxVars[] AssignedVars[main_~x~0] {25881#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:04,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {25805#true} ~x~0 := 0;~y~0 := 500000; {25888#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:04,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {25805#true} call #t~ret4 := main(); {25805#true} is VALID [2022-04-15 07:00:04,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25805#true} {25805#true} #41#return; {25805#true} is VALID [2022-04-15 07:00:04,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {25805#true} assume true; {25805#true} is VALID [2022-04-15 07:00:04,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {25805#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25805#true} is VALID [2022-04-15 07:00:04,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {25805#true} call ULTIMATE.init(); {25805#true} is VALID [2022-04-15 07:00:04,050 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 07:00:04,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021933653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:04,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:04,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:00:05,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:05,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524153458] [2022-04-15 07:00:05,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524153458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:05,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:05,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 07:00:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569029249] [2022-04-15 07:00:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 07:00:05,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:05,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:05,744 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 07:00:05,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 07:00:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:05,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 07:00:05,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=3702, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:00:05,745 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:13,240 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-04-15 07:00:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 07:00:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 07:00:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-15 07:00:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-04-15 07:00:13,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 121 transitions. [2022-04-15 07:00:13,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:13,354 INFO L225 Difference]: With dead ends: 116 [2022-04-15 07:00:13,354 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 07:00:13,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=984, Invalid=11672, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 07:00:13,355 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4615 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:13,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 123 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4615 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 07:00:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 07:00:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-15 07:00:13,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:13,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,602 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,602 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:13,603 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-04-15 07:00:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-15 07:00:13,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:13,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:13,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 07:00:13,604 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 07:00:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:13,605 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-04-15 07:00:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-15 07:00:13,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:13,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:13,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:13,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2022-04-15 07:00:13,608 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 105 [2022-04-15 07:00:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:13,608 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2022-04-15 07:00:13,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 51 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 112 transitions. [2022-04-15 07:00:13,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-04-15 07:00:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 07:00:13,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:13,719 INFO L499 BasicCegarLoop]: trace histogram [48, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:13,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 07:00:13,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 07:00:13,920 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash -592552233, now seen corresponding path program 46 times [2022-04-15 07:00:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:13,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724759722] [2022-04-15 07:00:16,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:21,006 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:21,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:21,131 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1656661841, now seen corresponding path program 1 times [2022-04-15 07:00:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:21,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740163260] [2022-04-15 07:00:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:21,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {26731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-15 07:00:21,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-15 07:00:21,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-15 07:00:21,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:21,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {26731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-15 07:00:21,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-15 07:00:21,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-15 07:00:21,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-15 07:00:21,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26725#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:21,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {26725#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:21,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:21,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {26726#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26727#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 07:00:21,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {26727#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:21,248 INFO L272 TraceCheckUtils]: 10: Hoare triple {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:00:21,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {26729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:21,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {26730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26721#false} is VALID [2022-04-15 07:00:21,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-15 07:00:21,248 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 07:00:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:21,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740163260] [2022-04-15 07:00:21,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740163260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:21,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657965411] [2022-04-15 07:00:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:21,249 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 07:00:21,250 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 07:00:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:21,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:00:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:21,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:21,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26720#true} is VALID [2022-04-15 07:00:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-15 07:00:21,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-15 07:00:21,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-15 07:00:21,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-15 07:00:21,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26750#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:00:21,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {26750#(and (<= main_~x~0 0) (= main_~y~0 500000))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:21,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:21,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {26754#(and (= main_~y~0 500000) (< main_~x~0 500001))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26761#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:21,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {26761#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26765#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:21,680 INFO L272 TraceCheckUtils]: 10: Hoare triple {26765#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:21,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26773#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:21,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {26773#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26721#false} is VALID [2022-04-15 07:00:21,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-15 07:00:21,681 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 07:00:21,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:22,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {26721#false} assume !false; {26721#false} is VALID [2022-04-15 07:00:22,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {26773#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26721#false} is VALID [2022-04-15 07:00:22,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26773#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:22,034 INFO L272 TraceCheckUtils]: 10: Hoare triple {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {26769#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:22,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {26792#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [228] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {26728#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:22,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [231] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1909 v_main_~x~0_1908)) (.cse1 (= v_main_~y~0_1447 v_main_~y~0_1446)) (.cse2 (<= 500000 v_main_~x~0_1909))) (or (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_1909 v_main_~y~0_1446))) (and .cse2 (= (+ v_main_~x~0_1908 v_main_~y~0_1447) .cse3) (< v_main_~y~0_1447 v_main_~y~0_1446) (< .cse3 (+ 1000001 v_main_~y~0_1447)))) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1909 1000000)))))) InVars {main_~x~0=v_main_~x~0_1909, main_~y~0=v_main_~y~0_1447} OutVars{main_~x~0=v_main_~x~0_1908, main_~y~0=v_main_~y~0_1446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {26792#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:22,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [230] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:22,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {26803#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [229] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1907 v_main_~x~0_1906))) (or .cse0 (and (< v_main_~x~0_1907 v_main_~x~0_1906) (< v_main_~x~0_1906 500001)) (and (<= 500000 v_main_~x~0_1907) .cse0))) InVars {main_~x~0=v_main_~x~0_1907} OutVars{main_~x~0=v_main_~x~0_1906} AuxVars[] AssignedVars[main_~x~0] {26796#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:22,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {26720#true} ~x~0 := 0;~y~0 := 500000; {26803#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:22,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {26720#true} call #t~ret4 := main(); {26720#true} is VALID [2022-04-15 07:00:22,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26720#true} {26720#true} #41#return; {26720#true} is VALID [2022-04-15 07:00:22,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {26720#true} assume true; {26720#true} is VALID [2022-04-15 07:00:22,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {26720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {26720#true} is VALID [2022-04-15 07:00:22,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {26720#true} call ULTIMATE.init(); {26720#true} is VALID [2022-04-15 07:00:22,037 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 07:00:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657965411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:22,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:22,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:00:24,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:24,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724759722] [2022-04-15 07:00:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724759722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:24,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:24,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 07:00:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791389247] [2022-04-15 07:00:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:24,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:24,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:24,311 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 07:00:24,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 07:00:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 07:00:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 07:00:24,312 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:32,654 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-04-15 07:00:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 07:00:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-15 07:00:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-04-15 07:00:32,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 123 transitions. [2022-04-15 07:00:32,759 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 07:00:32,760 INFO L225 Difference]: With dead ends: 118 [2022-04-15 07:00:32,760 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 07:00:32,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1003, Invalid=12107, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 07:00:32,761 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:32,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 138 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 07:00:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 07:00:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-15 07:00:33,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:33,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:33,097 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:33,097 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:33,098 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-15 07:00:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-15 07:00:33,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:33,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:33,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 07:00:33,098 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 07:00:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:33,099 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-15 07:00:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-15 07:00:33,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:33,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:33,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:33,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2022-04-15 07:00:33,100 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 107 [2022-04-15 07:00:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:33,101 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2022-04-15 07:00:33,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 52 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 07:00:33,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 114 transitions. [2022-04-15 07:00:33,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-15 07:00:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 07:00:33,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:33,205 INFO L499 BasicCegarLoop]: trace histogram [49, 47, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:33,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-15 07:00:33,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:33,405 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2024387314, now seen corresponding path program 47 times [2022-04-15 07:00:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:33,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512146436] [2022-04-15 07:00:37,466 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:37,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:41,632 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:41,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:41,734 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 392870319, now seen corresponding path program 1 times [2022-04-15 07:00:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726996988] [2022-04-15 07:00:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:41,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {27661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:41,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {27661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-15 07:00:41,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-15 07:00:41,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27655#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:41,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {27655#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:41,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:41,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {27656#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27657#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:41,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {27657#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:41,824 INFO L272 TraceCheckUtils]: 10: Hoare triple {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:00:41,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {27659#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {27660#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:41,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {27660#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27651#false} is VALID [2022-04-15 07:00:41,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-15 07:00:41,824 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 07:00:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:41,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726996988] [2022-04-15 07:00:41,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726996988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:41,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503418691] [2022-04-15 07:00:41,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:41,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:41,826 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 07:00:41,826 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 07:00:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:41,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:00:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:42,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27650#true} is VALID [2022-04-15 07:00:42,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-15 07:00:42,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 07:00:42,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-15 07:00:42,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-15 07:00:42,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27680#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:00:42,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {27680#(and (<= main_~x~0 0) (= main_~y~0 500000))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:42,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:42,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {27684#(and (= main_~y~0 500000) (< main_~x~0 500001))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27691#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:42,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {27691#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27695#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:42,255 INFO L272 TraceCheckUtils]: 10: Hoare triple {27695#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:42,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:42,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {27703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27651#false} is VALID [2022-04-15 07:00:42,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-15 07:00:42,256 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 07:00:42,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:42,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-15 07:00:42,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {27703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27651#false} is VALID [2022-04-15 07:00:42,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:42,602 INFO L272 TraceCheckUtils]: 10: Hoare triple {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {27699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:42,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {27722#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [232] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {27658#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:42,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [235] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1974)) (.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= v_main_~y~0_1502 v_main_~y~0_1501))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1974 1000000)))) (and (= (+ v_main_~x~0_1973 v_main_~y~0_1502) (+ v_main_~x~0_1974 v_main_~y~0_1501)) (< v_main_~x~0_1974 v_main_~x~0_1973) (< v_main_~x~0_1973 1000001) .cse2) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1974, main_~y~0=v_main_~y~0_1502} OutVars{main_~x~0=v_main_~x~0_1973, main_~y~0=v_main_~y~0_1501} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {27722#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:42,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [234] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:42,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {27733#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [233] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1972 v_main_~x~0_1971))) (or (and (< v_main_~x~0_1971 500001) (< v_main_~x~0_1972 v_main_~x~0_1971)) (and (<= 500000 v_main_~x~0_1972) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1971} AuxVars[] AssignedVars[main_~x~0] {27726#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:42,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#true} ~x~0 := 0;~y~0 := 500000; {27733#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:42,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret4 := main(); {27650#true} is VALID [2022-04-15 07:00:42,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #41#return; {27650#true} is VALID [2022-04-15 07:00:42,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 07:00:42,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27650#true} is VALID [2022-04-15 07:00:42,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27650#true} is VALID [2022-04-15 07:00:42,605 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 07:00:42,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503418691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:42,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:42,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:00:45,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:45,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512146436] [2022-04-15 07:00:45,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512146436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:45,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:45,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 07:00:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215456145] [2022-04-15 07:00:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 07:00:45,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:45,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:45,278 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 07:00:45,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 07:00:45,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 07:00:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=3948, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:00:45,279 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:54,706 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-04-15 07:00:54,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 07:00:54,706 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 07:00:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-15 07:00:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 125 transitions. [2022-04-15 07:00:54,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 125 transitions. [2022-04-15 07:00:54,814 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 07:00:54,815 INFO L225 Difference]: With dead ends: 120 [2022-04-15 07:00:54,815 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 07:00:54,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1022, Invalid=12550, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 07:00:54,816 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:54,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 128 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 07:00:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 07:00:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-15 07:00:55,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:55,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:55,161 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:55,161 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:55,162 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 07:00:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 07:00:55,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:55,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:55,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 07:00:55,162 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 07:00:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:55,163 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 07:00:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 07:00:55,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:55,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:55,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:55,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-04-15 07:00:55,164 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 109 [2022-04-15 07:00:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:55,164 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-04-15 07:00:55,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 53 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:55,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2022-04-15 07:00:55,266 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 07:00:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 07:00:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 07:00:55,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:55,266 INFO L499 BasicCegarLoop]: trace histogram [50, 48, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:55,283 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 07:00:55,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 07:00:55,467 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash 52456525, now seen corresponding path program 48 times [2022-04-15 07:00:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159567456] [2022-04-15 07:00:55,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:55,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:55,680 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1852564817, now seen corresponding path program 1 times [2022-04-15 07:00:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:55,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635360408] [2022-04-15 07:00:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {28606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:55,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {28606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-15 07:00:55,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-15 07:00:55,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28600#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:00:55,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {28600#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:55,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:55,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {28601#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28602#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:55,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {28602#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:55,774 INFO L272 TraceCheckUtils]: 10: Hoare triple {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28604#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:00:55,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {28604#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28605#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:55,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {28605#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28596#false} is VALID [2022-04-15 07:00:55,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-15 07:00:55,775 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 07:00:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635360408] [2022-04-15 07:00:55,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635360408] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621768232] [2022-04-15 07:00:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:55,777 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 07:00:55,777 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 07:00:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:00:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:55,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:56,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28595#true} is VALID [2022-04-15 07:00:56,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-15 07:00:56,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-15 07:00:56,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-15 07:00:56,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-15 07:00:56,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28625#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:00:56,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {28625#(and (<= main_~x~0 0) (= main_~y~0 500000))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:56,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:00:56,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {28629#(and (= main_~y~0 500000) (< main_~x~0 500001))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28636#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:56,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {28636#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28640#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:56,170 INFO L272 TraceCheckUtils]: 10: Hoare triple {28640#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:56,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:56,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {28648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28596#false} is VALID [2022-04-15 07:00:56,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-15 07:00:56,171 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 07:00:56,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:56,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {28596#false} assume !false; {28596#false} is VALID [2022-04-15 07:00:56,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {28648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28596#false} is VALID [2022-04-15 07:00:56,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:00:56,538 INFO L272 TraceCheckUtils]: 10: Hoare triple {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {28644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:56,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {28667#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [236] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {28603#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:00:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [239] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse2 (= v_main_~y~0_1558 v_main_~y~0_1557)) (.cse1 (<= 500000 v_main_~x~0_2040))) (or (and .cse0 (or (not (< v_main_~x~0_2040 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2) (and .cse1 (< v_main_~x~0_2040 v_main_~x~0_2039) (= (+ v_main_~x~0_2040 v_main_~y~0_1557) (+ v_main_~x~0_2039 v_main_~y~0_1558)) (< v_main_~x~0_2039 1000001)))) InVars {main_~x~0=v_main_~x~0_2040, main_~y~0=v_main_~y~0_1558} OutVars{main_~x~0=v_main_~x~0_2039, main_~y~0=v_main_~y~0_1557} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {28667#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:56,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [238] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:56,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {28678#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [237] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2038 v_main_~x~0_2037))) (or .cse0 (and (< v_main_~x~0_2037 500001) (< v_main_~x~0_2038 v_main_~x~0_2037)) (and (not (< v_main_~x~0_2038 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_2038} OutVars{main_~x~0=v_main_~x~0_2037} AuxVars[] AssignedVars[main_~x~0] {28671#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:00:56,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {28595#true} ~x~0 := 0;~y~0 := 500000; {28678#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:00:56,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {28595#true} call #t~ret4 := main(); {28595#true} is VALID [2022-04-15 07:00:56,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28595#true} {28595#true} #41#return; {28595#true} is VALID [2022-04-15 07:00:56,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {28595#true} assume true; {28595#true} is VALID [2022-04-15 07:00:56,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {28595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28595#true} is VALID [2022-04-15 07:00:56,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {28595#true} call ULTIMATE.init(); {28595#true} is VALID [2022-04-15 07:00:56,541 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 07:00:56,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621768232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:56,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:56,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:00:58,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:58,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159567456] [2022-04-15 07:00:58,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159567456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:58,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:58,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 07:00:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157271787] [2022-04-15 07:00:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:58,905 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 07:00:58,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:58,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:58,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:58,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 07:00:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:58,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 07:00:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4074, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 07:00:58,961 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:08,374 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-04-15 07:01:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 07:01:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 07:01:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 127 transitions. [2022-04-15 07:01:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 127 transitions. [2022-04-15 07:01:08,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 127 transitions. [2022-04-15 07:01:08,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:08,463 INFO L225 Difference]: With dead ends: 122 [2022-04-15 07:01:08,463 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 07:01:08,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1041, Invalid=13001, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 07:01:08,464 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:08,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 208 Invalid, 5486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 07:01:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 07:01:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-15 07:01:08,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:08,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,744 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,744 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:08,745 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-04-15 07:01:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-15 07:01:08,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:08,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:08,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-15 07:01:08,745 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-15 07:01:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:08,746 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-04-15 07:01:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-15 07:01:08,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:08,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:08,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:08,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-04-15 07:01:08,747 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 111 [2022-04-15 07:01:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:08,748 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-04-15 07:01:08,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 54 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:08,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 118 transitions. [2022-04-15 07:01:08,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-15 07:01:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 07:01:08,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:08,829 INFO L499 BasicCegarLoop]: trace histogram [51, 49, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:08,890 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 07:01:09,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:09,043 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -892454168, now seen corresponding path program 49 times [2022-04-15 07:01:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:09,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921819947] [2022-04-15 07:01:13,104 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:13,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:13,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:13,374 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 196967343, now seen corresponding path program 1 times [2022-04-15 07:01:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302130743] [2022-04-15 07:01:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:13,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {29566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-15 07:01:13,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-15 07:01:13,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-15 07:01:13,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:13,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {29566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-15 07:01:13,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-15 07:01:13,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-15 07:01:13,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-15 07:01:13,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29560#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:01:13,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {29560#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:13,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:13,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {29561#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:13,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:13,496 INFO L272 TraceCheckUtils]: 10: Hoare triple {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29564#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:01:13,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {29564#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29565#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:01:13,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {29565#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29556#false} is VALID [2022-04-15 07:01:13,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-15 07:01:13,497 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 07:01:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:13,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302130743] [2022-04-15 07:01:13,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302130743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:01:13,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378490876] [2022-04-15 07:01:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:13,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:13,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:01:13,499 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 07:01:13,499 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 07:01:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:13,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:01:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:13,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:01:13,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29555#true} is VALID [2022-04-15 07:01:13,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-15 07:01:13,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-15 07:01:13,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-15 07:01:13,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-15 07:01:13,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29585#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:01:13,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {29585#(and (<= main_~x~0 0) (= main_~y~0 500000))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:13,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:13,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {29589#(and (= main_~y~0 500000) (< main_~x~0 500001))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29596#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:13,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {29596#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29600#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:13,781 INFO L272 TraceCheckUtils]: 10: Hoare triple {29600#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:13,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:13,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {29608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29556#false} is VALID [2022-04-15 07:01:13,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-15 07:01:13,782 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 07:01:13,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:01:14,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {29556#false} assume !false; {29556#false} is VALID [2022-04-15 07:01:14,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {29608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29556#false} is VALID [2022-04-15 07:01:14,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:14,010 INFO L272 TraceCheckUtils]: 10: Hoare triple {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {29604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:14,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [240] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29563#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:14,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [243] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2107 v_main_~x~0_2106)) (.cse1 (= v_main_~y~0_1615 v_main_~y~0_1614)) (.cse2 (<= 500000 v_main_~x~0_2107))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2107 1000000)))) (and .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_2107 v_main_~y~0_1614))) (and .cse2 (< v_main_~y~0_1615 v_main_~y~0_1614) (< .cse3 (+ 1000001 v_main_~y~0_1615)) (= (+ v_main_~x~0_2106 v_main_~y~0_1615) .cse3))))) InVars {main_~x~0=v_main_~x~0_2107, main_~y~0=v_main_~y~0_1615} OutVars{main_~x~0=v_main_~x~0_2106, main_~y~0=v_main_~y~0_1614} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {29562#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:14,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [242] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:14,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {29637#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [241] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2105 v_main_~x~0_2104))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_2105)) (and (< v_main_~x~0_2105 v_main_~x~0_2104) (< v_main_~x~0_2104 500001)))) InVars {main_~x~0=v_main_~x~0_2105} OutVars{main_~x~0=v_main_~x~0_2104} AuxVars[] AssignedVars[main_~x~0] {29630#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:14,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {29555#true} ~x~0 := 0;~y~0 := 500000; {29637#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:14,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {29555#true} call #t~ret4 := main(); {29555#true} is VALID [2022-04-15 07:01:14,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29555#true} {29555#true} #41#return; {29555#true} is VALID [2022-04-15 07:01:14,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {29555#true} assume true; {29555#true} is VALID [2022-04-15 07:01:14,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {29555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29555#true} is VALID [2022-04-15 07:01:14,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {29555#true} call ULTIMATE.init(); {29555#true} is VALID [2022-04-15 07:01:14,013 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 07:01:14,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378490876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:01:14,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:01:14,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 07:01:16,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:16,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921819947] [2022-04-15 07:01:16,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921819947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:16,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:16,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 07:01:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989826528] [2022-04-15 07:01:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:16,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:16,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:16,463 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 07:01:16,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 07:01:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 07:01:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=4129, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 07:01:16,465 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:25,722 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-04-15 07:01:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 07:01:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 129 transitions. [2022-04-15 07:01:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 129 transitions. [2022-04-15 07:01:25,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 129 transitions. [2022-04-15 07:01:25,837 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 07:01:25,838 INFO L225 Difference]: With dead ends: 124 [2022-04-15 07:01:25,838 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 07:01:25,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=945, Invalid=13335, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 07:01:25,839 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 109 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 5648 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 5648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:25,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 238 Invalid, 5755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 5648 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 07:01:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 07:01:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-15 07:01:26,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:26,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,190 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,190 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:26,191 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-15 07:01:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-15 07:01:26,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:26,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:26,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 07:01:26,192 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 07:01:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:26,193 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-04-15 07:01:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-15 07:01:26,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:26,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:26,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:26,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2022-04-15 07:01:26,194 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 113 [2022-04-15 07:01:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:26,194 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2022-04-15 07:01:26,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 55 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 07:01:26,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 120 transitions. [2022-04-15 07:01:26,303 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 07:01:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2022-04-15 07:01:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 07:01:26,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:26,304 INFO L499 BasicCegarLoop]: trace histogram [52, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:26,330 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 07:01:26,504 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,SelfDestructingSolverStorable51 [2022-04-15 07:01:26,505 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1581436611, now seen corresponding path program 50 times [2022-04-15 07:01:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:26,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261336557] [2022-04-15 07:01:26,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:30,734 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:01:30,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:30,848 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2048467793, now seen corresponding path program 1 times [2022-04-15 07:01:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:30,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275111648] [2022-04-15 07:01:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:30,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {30540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-15 07:01:30,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-15 07:01:30,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-15 07:01:30,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:30,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {30540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-15 07:01:30,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-15 07:01:30,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-15 07:01:30,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-15 07:01:30,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30534#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:01:30,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {30534#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:30,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:30,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {30535#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30536#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:01:30,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {30536#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:01:30,995 INFO L272 TraceCheckUtils]: 10: Hoare triple {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30538#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:01:30,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {30538#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30539#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:01:30,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {30539#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30530#false} is VALID [2022-04-15 07:01:30,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-15 07:01:30,996 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 07:01:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275111648] [2022-04-15 07:01:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275111648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:01:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596003279] [2022-04-15 07:01:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:01:30,998 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 07:01:31,001 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 07:01:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:31,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:31,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:01:31,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30529#true} is VALID [2022-04-15 07:01:31,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-15 07:01:31,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-15 07:01:31,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-15 07:01:31,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-15 07:01:31,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30559#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:01:31,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {30559#(and (<= main_~x~0 0) (= main_~y~0 500000))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:31,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:31,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {30563#(and (= main_~y~0 500000) (< main_~x~0 500001))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30570#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:31,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {30570#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30574#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:31,417 INFO L272 TraceCheckUtils]: 10: Hoare triple {30574#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:31,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:31,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {30582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30530#false} is VALID [2022-04-15 07:01:31,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-15 07:01:31,417 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 07:01:31,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:01:31,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {30530#false} assume !false; {30530#false} is VALID [2022-04-15 07:01:31,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {30582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30530#false} is VALID [2022-04-15 07:01:31,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:31,630 INFO L272 TraceCheckUtils]: 10: Hoare triple {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {30578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:31,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {30601#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [244] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {30537#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:01:31,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [247] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2175)) (.cse2 (= v_main_~x~0_2175 v_main_~x~0_2174)) (.cse3 (= v_main_~y~0_1673 v_main_~y~0_1672))) (or (let ((.cse1 (+ v_main_~x~0_2175 v_main_~y~0_1672))) (and (< v_main_~y~0_1673 v_main_~y~0_1672) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1673)) (= (+ v_main_~x~0_2174 v_main_~y~0_1673) .cse1))) (and .cse2 .cse3) (and (or (not (< v_main_~x~0_2175 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_2175, main_~y~0=v_main_~y~0_1673} OutVars{main_~x~0=v_main_~x~0_2174, main_~y~0=v_main_~y~0_1672} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {30601#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:01:31,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [246] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:01:31,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {30612#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} [245] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2173 v_main_~x~0_2172))) (or (and (not (< v_main_~x~0_2173 500000)) .cse0) .cse0 (and (< v_main_~x~0_2172 500001) (< v_main_~x~0_2173 v_main_~x~0_2172)))) InVars {main_~x~0=v_main_~x~0_2173} OutVars{main_~x~0=v_main_~x~0_2172} AuxVars[] AssignedVars[main_~x~0] {30605#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:01:31,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {30529#true} ~x~0 := 0;~y~0 := 500000; {30612#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))))} is VALID [2022-04-15 07:01:31,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {30529#true} call #t~ret4 := main(); {30529#true} is VALID [2022-04-15 07:01:31,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30529#true} {30529#true} #41#return; {30529#true} is VALID [2022-04-15 07:01:31,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {30529#true} assume true; {30529#true} is VALID [2022-04-15 07:01:31,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30529#true} is VALID [2022-04-15 07:01:31,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {30529#true} call ULTIMATE.init(); {30529#true} is VALID [2022-04-15 07:01:31,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 07:01:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596003279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:01:31,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:01:31,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:01:33,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261336557] [2022-04-15 07:01:33,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261336557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:33,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 07:01:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723501352] [2022-04-15 07:01:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 07:01:33,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:33,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:33,666 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 07:01:33,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 07:01:33,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:33,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 07:01:33,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=4332, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 07:01:33,667 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,403 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-04-15 07:01:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 07:01:44,403 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 07:01:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 131 transitions. [2022-04-15 07:01:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 131 transitions. [2022-04-15 07:01:44,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 131 transitions. [2022-04-15 07:01:44,515 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 07:01:44,516 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:01:44,516 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 07:01:44,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2882 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1079, Invalid=13927, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 07:01:44,517 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 5842 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 5951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 5842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:44,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 233 Invalid, 5951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 5842 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 07:01:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 07:01:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-15 07:01:44,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:44,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,878 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,878 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,879 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 07:01:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-15 07:01:44,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:44,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:44,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-15 07:01:44,879 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-15 07:01:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:44,880 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 07:01:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-15 07:01:44,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:44,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:44,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:44,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2022-04-15 07:01:44,881 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 115 [2022-04-15 07:01:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:44,881 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2022-04-15 07:01:44,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:44,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 122 transitions. [2022-04-15 07:01:44,992 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 07:01:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-04-15 07:01:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 07:01:44,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:44,993 INFO L499 BasicCegarLoop]: trace histogram [53, 51, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:45,011 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 07:01:45,193 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,SelfDestructingSolverStorable52 [2022-04-15 07:01:45,193 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -421406754, now seen corresponding path program 51 times [2022-04-15 07:01:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356064917] [2022-04-15 07:01:47,331 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:47,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:47,546 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1064367, now seen corresponding path program 1 times [2022-04-15 07:01:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:47,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052084886] [2022-04-15 07:01:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {31530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-15 07:01:47,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-15 07:01:47,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-15 07:01:47,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:47,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {31530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-15 07:01:47,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-15 07:01:47,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-15 07:01:47,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-15 07:01:47,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31524#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:01:47,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {31524#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:47,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:01:47,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {31525#(or (<= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:47,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:47,648 INFO L272 TraceCheckUtils]: 10: Hoare triple {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:01:47,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {31528#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31529#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:01:47,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {31529#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31520#false} is VALID [2022-04-15 07:01:47,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-15 07:01:47,649 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 07:01:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:47,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052084886] [2022-04-15 07:01:47,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052084886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:01:47,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993006931] [2022-04-15 07:01:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:47,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:47,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:01:47,650 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 07:01:47,658 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 07:01:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:01:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:47,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:01:47,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31519#true} is VALID [2022-04-15 07:01:47,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-15 07:01:47,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-15 07:01:47,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-15 07:01:47,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-15 07:01:47,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31549#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:01:47,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {31549#(and (<= main_~x~0 0) (= main_~y~0 500000))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:47,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:01:47,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {31553#(and (= main_~y~0 500000) (< main_~x~0 500001))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31560#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:47,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {31560#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31564#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:47,977 INFO L272 TraceCheckUtils]: 10: Hoare triple {31564#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:47,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31572#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:47,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {31572#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31520#false} is VALID [2022-04-15 07:01:47,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-15 07:01:47,977 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 07:01:47,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:01:48,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {31520#false} assume !false; {31520#false} is VALID [2022-04-15 07:01:48,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {31572#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31520#false} is VALID [2022-04-15 07:01:48,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31572#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:01:48,317 INFO L272 TraceCheckUtils]: 10: Hoare triple {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {31568#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:01:48,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [248] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {31527#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:01:48,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [251] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2244)) (.cse0 (= v_main_~y~0_1732 v_main_~y~0_1731)) (.cse2 (= v_main_~x~0_2244 v_main_~x~0_2243))) (or (and .cse0 (or (not (< v_main_~x~0_2244 1000000)) (not .cse1)) .cse2) (let ((.cse3 (+ v_main_~x~0_2244 v_main_~y~0_1731))) (and (< v_main_~y~0_1732 v_main_~y~0_1731) .cse1 (= .cse3 (+ v_main_~x~0_2243 v_main_~y~0_1732)) (< .cse3 (+ 1000001 v_main_~y~0_1732)))) (and .cse0 .cse2))) InVars {main_~x~0=v_main_~x~0_2244, main_~y~0=v_main_~y~0_1732} OutVars{main_~x~0=v_main_~x~0_2243, main_~y~0=v_main_~y~0_1731} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {31526#(or (<= main_~x~0 999999) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:48,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [250] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:48,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {31601#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [249] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2242 v_main_~x~0_2241))) (or (and .cse0 (<= 500000 v_main_~x~0_2242)) (and (< v_main_~x~0_2242 v_main_~x~0_2241) (< v_main_~x~0_2241 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2242} OutVars{main_~x~0=v_main_~x~0_2241} AuxVars[] AssignedVars[main_~x~0] {31594#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:48,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {31519#true} ~x~0 := 0;~y~0 := 500000; {31601#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:01:48,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {31519#true} call #t~ret4 := main(); {31519#true} is VALID [2022-04-15 07:01:48,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31519#true} {31519#true} #41#return; {31519#true} is VALID [2022-04-15 07:01:48,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {31519#true} assume true; {31519#true} is VALID [2022-04-15 07:01:48,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {31519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31519#true} is VALID [2022-04-15 07:01:48,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {31519#true} call ULTIMATE.init(); {31519#true} is VALID [2022-04-15 07:01:48,320 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 07:01:48,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993006931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:01:48,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:01:48,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 07:01:50,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:50,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356064917] [2022-04-15 07:01:50,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356064917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:50,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:50,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 07:01:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244973524] [2022-04-15 07:01:50,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 07:01:50,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:50,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:50,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:50,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 07:01:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:50,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 07:01:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4389, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 07:01:50,543 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:00,781 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-04-15 07:02:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 07:02:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 07:02:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-15 07:02:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-15 07:02:00,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 133 transitions. [2022-04-15 07:02:00,882 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 07:02:00,883 INFO L225 Difference]: With dead ends: 128 [2022-04-15 07:02:00,883 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 07:02:00,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=979, Invalid=14273, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 07:02:00,884 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5732 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 5732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:00,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 5732 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 07:02:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 07:02:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-15 07:02:01,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:01,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:01,104 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:01,104 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:01,105 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-15 07:02:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-15 07:02:01,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:01,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:01,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 07:02:01,106 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-15 07:02:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:01,107 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-15 07:02:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-15 07:02:01,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:01,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:01,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:01,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2022-04-15 07:02:01,108 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 117 [2022-04-15 07:02:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:01,108 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2022-04-15 07:02:01,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:01,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 124 transitions. [2022-04-15 07:02:01,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-15 07:02:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 07:02:01,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:01,186 INFO L499 BasicCegarLoop]: trace histogram [54, 52, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:01,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-15 07:02:01,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:01,392 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:01,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1008531911, now seen corresponding path program 52 times [2022-04-15 07:02:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:01,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1161296791] [2022-04-15 07:02:05,468 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:05,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:05,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:05,710 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2050596527, now seen corresponding path program 1 times [2022-04-15 07:02:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:05,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682677788] [2022-04-15 07:02:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:05,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {32534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:05,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {32534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-15 07:02:05,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-15 07:02:05,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32528#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:05,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {32528#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:05,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:05,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {32529#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32530#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:05,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {32530#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:05,837 INFO L272 TraceCheckUtils]: 10: Hoare triple {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32532#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:02:05,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32533#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:02:05,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {32533#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32524#false} is VALID [2022-04-15 07:02:05,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-15 07:02:05,838 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 07:02:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:05,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682677788] [2022-04-15 07:02:05,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682677788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:02:05,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769825886] [2022-04-15 07:02:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:05,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:02:05,840 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 07:02:05,841 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 07:02:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:05,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:02:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:05,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:02:06,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32523#true} is VALID [2022-04-15 07:02:06,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-15 07:02:06,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-15 07:02:06,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-15 07:02:06,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-15 07:02:06,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32553#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:02:06,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {32553#(and (<= main_~x~0 0) (= main_~y~0 500000))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:06,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:06,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {32557#(and (= main_~y~0 500000) (< main_~x~0 500001))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32564#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:06,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {32564#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32568#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:06,244 INFO L272 TraceCheckUtils]: 10: Hoare triple {32568#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:06,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:06,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {32576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32524#false} is VALID [2022-04-15 07:02:06,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-15 07:02:06,244 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 07:02:06,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:02:06,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {32524#false} assume !false; {32524#false} is VALID [2022-04-15 07:02:06,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {32576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32524#false} is VALID [2022-04-15 07:02:06,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:06,472 INFO L272 TraceCheckUtils]: 10: Hoare triple {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {32572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:06,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {32595#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [252] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {32531#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:06,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [255] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2314 v_main_~x~0_2313)) (.cse1 (= v_main_~y~0_1792 v_main_~y~0_1791)) (.cse2 (<= 500000 v_main_~x~0_2314))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2313 v_main_~y~0_1792) (+ v_main_~x~0_2314 v_main_~y~0_1791)) (< v_main_~x~0_2314 v_main_~x~0_2313) (< v_main_~x~0_2313 1000001)) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2314 1000000)))))) InVars {main_~x~0=v_main_~x~0_2314, main_~y~0=v_main_~y~0_1792} OutVars{main_~x~0=v_main_~x~0_2313, main_~y~0=v_main_~y~0_1791} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {32595#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:06,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [254] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:06,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {32606#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [253] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2312 v_main_~x~0_2311))) (or (and (<= 500000 v_main_~x~0_2312) .cse0) (and (< v_main_~x~0_2312 v_main_~x~0_2311) (< v_main_~x~0_2311 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_2312} OutVars{main_~x~0=v_main_~x~0_2311} AuxVars[] AssignedVars[main_~x~0] {32599#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:06,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {32523#true} ~x~0 := 0;~y~0 := 500000; {32606#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:06,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {32523#true} call #t~ret4 := main(); {32523#true} is VALID [2022-04-15 07:02:06,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32523#true} {32523#true} #41#return; {32523#true} is VALID [2022-04-15 07:02:06,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {32523#true} assume true; {32523#true} is VALID [2022-04-15 07:02:06,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {32523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32523#true} is VALID [2022-04-15 07:02:06,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {32523#true} call ULTIMATE.init(); {32523#true} is VALID [2022-04-15 07:02:06,474 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 07:02:06,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769825886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:02:06,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:02:06,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:02:08,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1161296791] [2022-04-15 07:02:08,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1161296791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:08,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 07:02:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059027966] [2022-04-15 07:02:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:08,823 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:08,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:08,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:08,880 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 07:02:08,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 07:02:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 07:02:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=4598, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 07:02:08,881 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:18,939 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-04-15 07:02:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 07:02:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-15 07:02:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-15 07:02:18,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 135 transitions. [2022-04-15 07:02:19,052 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 07:02:19,054 INFO L225 Difference]: With dead ends: 130 [2022-04-15 07:02:19,054 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 07:02:19,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1117, Invalid=14885, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 07:02:19,055 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6297 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 6410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 6297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:19,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 248 Invalid, 6410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 6297 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 07:02:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 07:02:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-15 07:02:19,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:19,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:19,425 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:19,425 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:19,426 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-15 07:02:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 07:02:19,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:19,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:19,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-15 07:02:19,426 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-15 07:02:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:19,427 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-15 07:02:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 07:02:19,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:19,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:19,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:19,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2022-04-15 07:02:19,428 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 119 [2022-04-15 07:02:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:19,429 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2022-04-15 07:02:19,429 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 58 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 07:02:19,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 126 transitions. [2022-04-15 07:02:19,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 07:02:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 07:02:19,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:19,540 INFO L499 BasicCegarLoop]: trace histogram [55, 53, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:19,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-15 07:02:19,740 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,SelfDestructingSolverStorable54 [2022-04-15 07:02:19,740 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1699875284, now seen corresponding path program 53 times [2022-04-15 07:02:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:19,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510408871] [2022-04-15 07:02:19,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:23,965 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:24,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:24,082 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash -194838609, now seen corresponding path program 1 times [2022-04-15 07:02:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:24,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903618069] [2022-04-15 07:02:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:24,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {33554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:24,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {33554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-15 07:02:24,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-15 07:02:24,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33548#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:24,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {33548#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:24,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:24,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {33549#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33550#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:24,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {33550#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:24,166 INFO L272 TraceCheckUtils]: 10: Hoare triple {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33552#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:02:24,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {33552#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33553#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:02:24,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {33553#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33544#false} is VALID [2022-04-15 07:02:24,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-15 07:02:24,167 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 07:02:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:24,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903618069] [2022-04-15 07:02:24,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903618069] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:02:24,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780591534] [2022-04-15 07:02:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:02:24,168 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 07:02:24,169 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 07:02:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:24,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:02:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:24,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:02:24,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33543#true} is VALID [2022-04-15 07:02:24,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-15 07:02:24,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 07:02:24,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-15 07:02:24,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-15 07:02:24,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33573#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:02:24,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {33573#(and (<= main_~x~0 0) (= main_~y~0 500000))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:24,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:24,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {33577#(and (= main_~y~0 500000) (< main_~x~0 500001))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33584#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:24,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {33584#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33588#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:24,582 INFO L272 TraceCheckUtils]: 10: Hoare triple {33588#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:24,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:24,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {33596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33544#false} is VALID [2022-04-15 07:02:24,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-15 07:02:24,583 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 07:02:24,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:02:24,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {33544#false} assume !false; {33544#false} is VALID [2022-04-15 07:02:24,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {33596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33544#false} is VALID [2022-04-15 07:02:24,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:24,908 INFO L272 TraceCheckUtils]: 10: Hoare triple {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {33592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:24,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {33615#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [256] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {33551#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:24,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [259] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2385 v_main_~x~0_2384)) (.cse2 (<= 500000 v_main_~x~0_2385)) (.cse1 (= v_main_~y~0_1853 v_main_~y~0_1852))) (or (and .cse0 .cse1) (and .cse2 (= (+ v_main_~x~0_2385 v_main_~y~0_1852) (+ v_main_~x~0_2384 v_main_~y~0_1853)) (< v_main_~x~0_2385 v_main_~x~0_2384) (< v_main_~x~0_2384 1000001)) (and .cse0 (or (not (< v_main_~x~0_2385 1000000)) (not .cse2)) .cse1))) InVars {main_~x~0=v_main_~x~0_2385, main_~y~0=v_main_~y~0_1853} OutVars{main_~x~0=v_main_~x~0_2384, main_~y~0=v_main_~y~0_1852} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {33615#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:24,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [258] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:24,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {33626#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [257] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2383 v_main_~x~0_2382))) (or (and (< v_main_~x~0_2382 500001) (< v_main_~x~0_2383 v_main_~x~0_2382)) (and (not (< v_main_~x~0_2383 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2382} AuxVars[] AssignedVars[main_~x~0] {33619#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:24,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {33543#true} ~x~0 := 0;~y~0 := 500000; {33626#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:24,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {33543#true} call #t~ret4 := main(); {33543#true} is VALID [2022-04-15 07:02:24,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33543#true} {33543#true} #41#return; {33543#true} is VALID [2022-04-15 07:02:24,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {33543#true} assume true; {33543#true} is VALID [2022-04-15 07:02:24,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {33543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33543#true} is VALID [2022-04-15 07:02:24,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {33543#true} call ULTIMATE.init(); {33543#true} is VALID [2022-04-15 07:02:24,911 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 07:02:24,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780591534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:02:24,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:02:24,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:02:27,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:27,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510408871] [2022-04-15 07:02:27,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510408871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:27,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:27,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 07:02:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095308399] [2022-04-15 07:02:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 07:02:27,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:27,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:27,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:27,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 07:02:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 07:02:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=4734, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:02:27,603 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:38,101 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2022-04-15 07:02:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 07:02:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 07:02:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 137 transitions. [2022-04-15 07:02:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 137 transitions. [2022-04-15 07:02:38,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 137 transitions. [2022-04-15 07:02:38,217 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 07:02:38,218 INFO L225 Difference]: With dead ends: 132 [2022-04-15 07:02:38,218 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 07:02:38,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1136, Invalid=15376, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 07:02:38,219 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 6624 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 6739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 6624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:38,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 298 Invalid, 6739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 6624 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 07:02:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 07:02:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-15 07:02:38,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:38,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,587 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,587 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:38,588 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-15 07:02:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-15 07:02:38,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:38,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:38,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 07:02:38,589 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 07:02:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:38,590 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-15 07:02:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-15 07:02:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:38,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:38,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:38,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 120 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-04-15 07:02:38,591 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 121 [2022-04-15 07:02:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:38,591 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-04-15 07:02:38,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.95) internal successors, (117), 59 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:38,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 128 transitions. [2022-04-15 07:02:38,705 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 07:02:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-04-15 07:02:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 07:02:38,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:38,705 INFO L499 BasicCegarLoop]: trace histogram [56, 54, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:38,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-15 07:02:38,906 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,SelfDestructingSolverStorable55 [2022-04-15 07:02:38,906 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1729008303, now seen corresponding path program 54 times [2022-04-15 07:02:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:38,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120464477] [2022-04-15 07:02:42,973 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:02:43,033 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:43,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:43,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1854693551, now seen corresponding path program 1 times [2022-04-15 07:02:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:43,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936073783] [2022-04-15 07:02:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:43,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {34589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-15 07:02:43,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-15 07:02:43,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-15 07:02:43,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:43,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {34589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-15 07:02:43,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-15 07:02:43,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-15 07:02:43,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-15 07:02:43,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34583#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:43,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {34583#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:43,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:43,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {34584#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34585#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {34585#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:43,316 INFO L272 TraceCheckUtils]: 10: Hoare triple {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34587#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:02:43,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {34587#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34588#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:02:43,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {34588#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34579#false} is VALID [2022-04-15 07:02:43,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-15 07:02:43,316 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 07:02:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936073783] [2022-04-15 07:02:43,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936073783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:02:43,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870109106] [2022-04-15 07:02:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:43,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:02:43,318 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 07:02:43,318 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 07:02:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:43,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:02:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:43,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:02:43,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34578#true} is VALID [2022-04-15 07:02:43,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-15 07:02:43,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-15 07:02:43,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-15 07:02:43,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-15 07:02:43,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34608#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:02:43,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {34608#(and (<= main_~x~0 0) (= main_~y~0 500000))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:43,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:43,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {34612#(and (= main_~y~0 500000) (< main_~x~0 500001))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34619#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {34619#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34623#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:43,660 INFO L272 TraceCheckUtils]: 10: Hoare triple {34623#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:43,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:43,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {34631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34579#false} is VALID [2022-04-15 07:02:43,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-15 07:02:43,661 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 07:02:43,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:02:43,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {34579#false} assume !false; {34579#false} is VALID [2022-04-15 07:02:43,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {34631#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34579#false} is VALID [2022-04-15 07:02:43,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34631#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:43,966 INFO L272 TraceCheckUtils]: 10: Hoare triple {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {34627#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:43,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {34650#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [260] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {34586#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:43,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [263] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= v_main_~y~0_1915 v_main_~y~0_1914)) (.cse2 (<= 500000 v_main_~x~0_2457))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2457 1000000)))) (and .cse0 .cse1) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (= (+ v_main_~x~0_2457 v_main_~y~0_1914) (+ v_main_~x~0_2456 v_main_~y~0_1915)) .cse2 (< v_main_~x~0_2456 1000001)))) InVars {main_~x~0=v_main_~x~0_2457, main_~y~0=v_main_~y~0_1915} OutVars{main_~x~0=v_main_~x~0_2456, main_~y~0=v_main_~y~0_1914} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {34650#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [262] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {34661#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [261] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2455 v_main_~x~0_2454))) (or (and (< v_main_~x~0_2454 500001) (< v_main_~x~0_2455 v_main_~x~0_2454)) (and (not (< v_main_~x~0_2455 500000)) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_2455} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[main_~x~0] {34654#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {34578#true} ~x~0 := 0;~y~0 := 500000; {34661#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:43,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {34578#true} call #t~ret4 := main(); {34578#true} is VALID [2022-04-15 07:02:43,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34578#true} {34578#true} #41#return; {34578#true} is VALID [2022-04-15 07:02:43,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {34578#true} assume true; {34578#true} is VALID [2022-04-15 07:02:43,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {34578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34578#true} is VALID [2022-04-15 07:02:43,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {34578#true} call ULTIMATE.init(); {34578#true} is VALID [2022-04-15 07:02:43,969 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 07:02:43,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870109106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:02:43,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:02:43,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:02:46,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:02:46,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120464477] [2022-04-15 07:02:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120464477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:02:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:02:46,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 07:02:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151218299] [2022-04-15 07:02:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:02:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 07:02:46,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:02:46,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:46,718 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 07:02:46,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 07:02:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 07:02:46,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 07:02:46,719 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:56,817 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-15 07:02:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 07:02:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 07:02:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:02:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 139 transitions. [2022-04-15 07:02:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 139 transitions. [2022-04-15 07:02:56,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 139 transitions. [2022-04-15 07:02:56,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:02:56,905 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:02:56,905 INFO L226 Difference]: Without dead ends: 127 [2022-04-15 07:02:56,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1155, Invalid=15875, Unknown=0, NotChecked=0, Total=17030 [2022-04-15 07:02:56,907 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 6779 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 6779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:02:56,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 268 Invalid, 6896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 6779 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 07:02:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-15 07:02:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-15 07:02:57,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:02:57,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:57,192 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:57,192 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:57,193 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-15 07:02:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-15 07:02:57,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:57,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:57,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-15 07:02:57,194 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-15 07:02:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:02:57,195 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2022-04-15 07:02:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-15 07:02:57,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:02:57,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:02:57,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:02:57,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:02:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2022-04-15 07:02:57,197 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 123 [2022-04-15 07:02:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:02:57,197 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2022-04-15 07:02:57,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 60 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:02:57,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 130 transitions. [2022-04-15 07:02:57,324 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 07:02:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2022-04-15 07:02:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 07:02:57,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:02:57,324 INFO L499 BasicCegarLoop]: trace histogram [57, 55, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:02:57,340 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 07:02:57,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:57,525 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:02:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:02:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -338931510, now seen corresponding path program 55 times [2022-04-15 07:02:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:02:57,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783869473] [2022-04-15 07:02:57,606 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:57,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:02:57,748 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:02:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -390741585, now seen corresponding path program 1 times [2022-04-15 07:02:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:02:57,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434812159] [2022-04-15 07:02:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:02:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:57,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:02:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:57,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {35639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:02:57,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {35639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-15 07:02:57,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-15 07:02:57,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35633#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:02:57,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {35633#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:57,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:57,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {35634#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35635#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:57,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {35635#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:57,862 INFO L272 TraceCheckUtils]: 10: Hoare triple {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:02:57,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {35637#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35638#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:02:57,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {35638#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35629#false} is VALID [2022-04-15 07:02:57,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-15 07:02:57,863 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 07:02:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:02:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434812159] [2022-04-15 07:02:57,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434812159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:02:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718425626] [2022-04-15 07:02:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:02:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:02:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:02:57,864 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 07:02:57,865 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 07:02:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:57,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:02:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:02:57,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:02:58,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35628#true} is VALID [2022-04-15 07:02:58,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-15 07:02:58,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-15 07:02:58,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-15 07:02:58,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-15 07:02:58,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35658#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:02:58,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {35658#(and (<= main_~x~0 0) (= main_~y~0 500000))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:58,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:02:58,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {35662#(and (= main_~y~0 500000) (< main_~x~0 500001))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35669#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:58,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {35669#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35673#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:58,199 INFO L272 TraceCheckUtils]: 10: Hoare triple {35673#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:58,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:58,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {35681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35629#false} is VALID [2022-04-15 07:02:58,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-15 07:02:58,200 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 07:02:58,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:02:58,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {35629#false} assume !false; {35629#false} is VALID [2022-04-15 07:02:58,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {35681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35629#false} is VALID [2022-04-15 07:02:58,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:02:58,463 INFO L272 TraceCheckUtils]: 10: Hoare triple {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {35677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:02:58,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {35700#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [264] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {35636#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:02:58,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [267] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1978 v_main_~y~0_1977)) (.cse1 (<= 500000 v_main_~x~0_2530))) (or (and .cse0 (= v_main_~x~0_2529 v_main_~x~0_2530) (or (not .cse1) (not (< v_main_~x~0_2530 1000000)))) (and .cse0 (= v_main_~x~0_2530 v_main_~x~0_2529)) (and (< v_main_~x~0_2529 1000001) (< v_main_~x~0_2530 v_main_~x~0_2529) .cse1 (= (+ v_main_~x~0_2529 v_main_~y~0_1978) (+ v_main_~x~0_2530 v_main_~y~0_1977))))) InVars {main_~x~0=v_main_~x~0_2530, main_~y~0=v_main_~y~0_1978} OutVars{main_~x~0=v_main_~x~0_2529, main_~y~0=v_main_~y~0_1977} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {35700#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:58,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [266] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:58,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {35711#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [265] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2528 v_main_~x~0_2527))) (or (and .cse0 (not (< v_main_~x~0_2528 500000))) .cse0 (and (< v_main_~x~0_2528 v_main_~x~0_2527) (< v_main_~x~0_2527 500001)))) InVars {main_~x~0=v_main_~x~0_2528} OutVars{main_~x~0=v_main_~x~0_2527} AuxVars[] AssignedVars[main_~x~0] {35704#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:02:58,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {35628#true} ~x~0 := 0;~y~0 := 500000; {35711#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:02:58,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {35628#true} call #t~ret4 := main(); {35628#true} is VALID [2022-04-15 07:02:58,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35628#true} {35628#true} #41#return; {35628#true} is VALID [2022-04-15 07:02:58,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {35628#true} assume true; {35628#true} is VALID [2022-04-15 07:02:58,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {35628#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35628#true} is VALID [2022-04-15 07:02:58,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {35628#true} call ULTIMATE.init(); {35628#true} is VALID [2022-04-15 07:02:58,465 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 07:02:58,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718425626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:02:58,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:02:58,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:03:00,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:00,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783869473] [2022-04-15 07:03:00,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783869473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:00,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:00,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 07:03:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363914460] [2022-04-15 07:03:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:00,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:00,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:00,915 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 07:03:00,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 07:03:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 07:03:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=5012, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 07:03:00,916 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:10,046 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-04-15 07:03:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 07:03:10,046 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2022-04-15 07:03:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 141 transitions. [2022-04-15 07:03:10,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 141 transitions. [2022-04-15 07:03:10,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:10,127 INFO L225 Difference]: With dead ends: 136 [2022-04-15 07:03:10,127 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 07:03:10,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3292 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1174, Invalid=16382, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 07:03:10,129 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6762 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 6762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:10,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 158 Invalid, 6881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 6762 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 07:03:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 07:03:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-15 07:03:10,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:10,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:10,358 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:10,358 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:10,359 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-15 07:03:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-15 07:03:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:10,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:10,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 07:03:10,360 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 07:03:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:10,360 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-15 07:03:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-15 07:03:10,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:10,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:10,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:10,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-15 07:03:10,362 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 125 [2022-04-15 07:03:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:10,362 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-15 07:03:10,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 61 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 07:03:10,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 132 transitions. [2022-04-15 07:03:10,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-15 07:03:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 07:03:10,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:10,446 INFO L499 BasicCegarLoop]: trace histogram [58, 56, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:10,462 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 07:03:10,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:03:10,659 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 940766245, now seen corresponding path program 56 times [2022-04-15 07:03:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995104259] [2022-04-15 07:03:14,708 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:14,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:14,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:14,975 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1658790575, now seen corresponding path program 1 times [2022-04-15 07:03:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:14,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36244833] [2022-04-15 07:03:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:15,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:15,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {36704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-15 07:03:15,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-15 07:03:15,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-15 07:03:15,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:15,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {36704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-15 07:03:15,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-15 07:03:15,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-15 07:03:15,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-15 07:03:15,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36698#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:15,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {36698#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:15,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:15,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {36699#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36700#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {36700#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:15,059 INFO L272 TraceCheckUtils]: 10: Hoare triple {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:03:15,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {36702#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36703#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:03:15,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {36703#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36694#false} is VALID [2022-04-15 07:03:15,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-15 07:03:15,060 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 07:03:15,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:15,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36244833] [2022-04-15 07:03:15,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36244833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:03:15,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703792116] [2022-04-15 07:03:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:15,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:03:15,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:03:15,061 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 07:03:15,062 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 07:03:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:15,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:03:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:15,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:03:15,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36693#true} is VALID [2022-04-15 07:03:15,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-15 07:03:15,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-15 07:03:15,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-15 07:03:15,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-15 07:03:15,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36723#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:03:15,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {36723#(and (<= main_~x~0 0) (= main_~y~0 500000))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:15,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:15,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {36727#(and (= main_~y~0 500000) (< main_~x~0 500001))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36734#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {36734#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36738#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:15,461 INFO L272 TraceCheckUtils]: 10: Hoare triple {36738#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:15,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:15,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {36746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36694#false} is VALID [2022-04-15 07:03:15,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-15 07:03:15,462 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 07:03:15,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:03:15,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {36694#false} assume !false; {36694#false} is VALID [2022-04-15 07:03:15,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {36746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36694#false} is VALID [2022-04-15 07:03:15,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:15,784 INFO L272 TraceCheckUtils]: 10: Hoare triple {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {36742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:15,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {36765#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [268] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {36701#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:15,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [271] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2604 v_main_~x~0_2603)) (.cse1 (= v_main_~y~0_2042 v_main_~y~0_2041)) (.cse2 (<= 500000 v_main_~x~0_2604))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not (< v_main_~x~0_2604 1000000)) (not .cse2))) (and (= (+ v_main_~x~0_2604 v_main_~y~0_2041) (+ v_main_~x~0_2603 v_main_~y~0_2042)) (< v_main_~x~0_2604 v_main_~x~0_2603) .cse2 (< v_main_~x~0_2603 1000001)))) InVars {main_~x~0=v_main_~x~0_2604, main_~y~0=v_main_~y~0_2042} OutVars{main_~x~0=v_main_~x~0_2603, main_~y~0=v_main_~y~0_2041} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {36765#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [270] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {36776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [269] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2602 v_main_~x~0_2601))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2602 500000))) (and (< v_main_~x~0_2601 500001) (< v_main_~x~0_2602 v_main_~x~0_2601)))) InVars {main_~x~0=v_main_~x~0_2602} OutVars{main_~x~0=v_main_~x~0_2601} AuxVars[] AssignedVars[main_~x~0] {36769#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {36693#true} ~x~0 := 0;~y~0 := 500000; {36776#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:15,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {36693#true} call #t~ret4 := main(); {36693#true} is VALID [2022-04-15 07:03:15,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36693#true} {36693#true} #41#return; {36693#true} is VALID [2022-04-15 07:03:15,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {36693#true} assume true; {36693#true} is VALID [2022-04-15 07:03:15,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {36693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36693#true} is VALID [2022-04-15 07:03:15,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {36693#true} call ULTIMATE.init(); {36693#true} is VALID [2022-04-15 07:03:15,787 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 07:03:15,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703792116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:03:15,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:03:15,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:03:18,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:18,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995104259] [2022-04-15 07:03:18,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995104259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 07:03:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64051179] [2022-04-15 07:03:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 07:03:18,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:18,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:18,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:18,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 07:03:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 07:03:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=5154, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 07:03:18,469 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:29,684 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-15 07:03:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 07:03:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 07:03:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 143 transitions. [2022-04-15 07:03:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 143 transitions. [2022-04-15 07:03:29,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 143 transitions. [2022-04-15 07:03:29,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:29,804 INFO L225 Difference]: With dead ends: 138 [2022-04-15 07:03:29,804 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 07:03:29,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3377 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1193, Invalid=16897, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 07:03:29,805 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 123 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6923 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 6923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:29,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 78 Invalid, 7044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 6923 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 07:03:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 07:03:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-15 07:03:30,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:30,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:30,090 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:30,090 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:30,091 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-15 07:03:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-15 07:03:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:30,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:30,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 07:03:30,092 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 07:03:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:30,093 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-15 07:03:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-15 07:03:30,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:30,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:30,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:30,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2022-04-15 07:03:30,094 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 127 [2022-04-15 07:03:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:30,094 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2022-04-15 07:03:30,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 62 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:30,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 134 transitions. [2022-04-15 07:03:30,226 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 07:03:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-15 07:03:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 07:03:30,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:30,226 INFO L499 BasicCegarLoop]: trace histogram [59, 57, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:30,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-15 07:03:30,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:03:30,427 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1925305152, now seen corresponding path program 57 times [2022-04-15 07:03:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044618789] [2022-04-15 07:03:34,494 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:34,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:38,676 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:38,796 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:38,797 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash -586644561, now seen corresponding path program 1 times [2022-04-15 07:03:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:38,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444936326] [2022-04-15 07:03:38,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:38,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {37784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:38,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {37784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-15 07:03:38,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-15 07:03:38,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37778#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:38,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {37778#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:03:38,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:03:38,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {37779#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37780#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:38,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {37780#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:38,888 INFO L272 TraceCheckUtils]: 10: Hoare triple {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37782#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:03:38,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {37782#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37783#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:03:38,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {37783#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37774#false} is VALID [2022-04-15 07:03:38,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-15 07:03:38,889 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 07:03:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444936326] [2022-04-15 07:03:38,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444936326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:03:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354998555] [2022-04-15 07:03:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:03:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:03:38,903 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 07:03:38,904 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 07:03:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:38,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:03:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:38,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:03:39,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37773#true} is VALID [2022-04-15 07:03:39,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-15 07:03:39,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-15 07:03:39,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-15 07:03:39,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-15 07:03:39,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37803#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:03:39,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {37803#(and (<= main_~x~0 0) (= main_~y~0 500000))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:39,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:39,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {37807#(and (= main_~y~0 500000) (< main_~x~0 500001))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37814#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:39,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {37814#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37818#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:39,292 INFO L272 TraceCheckUtils]: 10: Hoare triple {37818#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:39,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:39,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {37826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37774#false} is VALID [2022-04-15 07:03:39,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-15 07:03:39,292 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 07:03:39,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:03:39,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {37774#false} assume !false; {37774#false} is VALID [2022-04-15 07:03:39,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {37826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37774#false} is VALID [2022-04-15 07:03:39,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:39,513 INFO L272 TraceCheckUtils]: 10: Hoare triple {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {37822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:39,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {37845#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [272] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {37781#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:39,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [275] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_2107 v_main_~y~0_2106)) (.cse1 (= v_main_~x~0_2679 v_main_~x~0_2678)) (.cse2 (<= 500000 v_main_~x~0_2679))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2679 1000000)))) (let ((.cse3 (+ v_main_~x~0_2679 v_main_~y~0_2106))) (and .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2107)) (= .cse3 (+ v_main_~x~0_2678 v_main_~y~0_2107)) (< v_main_~y~0_2107 v_main_~y~0_2106))))) InVars {main_~x~0=v_main_~x~0_2679, main_~y~0=v_main_~y~0_2107} OutVars{main_~x~0=v_main_~x~0_2678, main_~y~0=v_main_~y~0_2106} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {37845#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:39,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [274] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:39,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {37856#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [273] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2677 v_main_~x~0_2676))) (or .cse0 (and (< v_main_~x~0_2676 500001) (< v_main_~x~0_2677 v_main_~x~0_2676)) (and (<= 500000 v_main_~x~0_2677) .cse0))) InVars {main_~x~0=v_main_~x~0_2677} OutVars{main_~x~0=v_main_~x~0_2676} AuxVars[] AssignedVars[main_~x~0] {37849#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:39,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {37773#true} ~x~0 := 0;~y~0 := 500000; {37856#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:39,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {37773#true} call #t~ret4 := main(); {37773#true} is VALID [2022-04-15 07:03:39,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37773#true} {37773#true} #41#return; {37773#true} is VALID [2022-04-15 07:03:39,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {37773#true} assume true; {37773#true} is VALID [2022-04-15 07:03:39,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {37773#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37773#true} is VALID [2022-04-15 07:03:39,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {37773#true} call ULTIMATE.init(); {37773#true} is VALID [2022-04-15 07:03:39,516 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 07:03:39,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354998555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:03:39,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:03:39,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:03:41,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:03:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044618789] [2022-04-15 07:03:41,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044618789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:03:41,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:03:41,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 07:03:41,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236995704] [2022-04-15 07:03:41,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:03:41,989 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 07:03:41,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:03:41,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:42,052 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 07:03:42,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 07:03:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 07:03:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=5298, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 07:03:42,053 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:52,411 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2022-04-15 07:03:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 07:03:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 07:03:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:03:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2022-04-15 07:03:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 145 transitions. [2022-04-15 07:03:52,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 145 transitions. [2022-04-15 07:03:52,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:03:52,494 INFO L225 Difference]: With dead ends: 140 [2022-04-15 07:03:52,494 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 07:03:52,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1212, Invalid=17420, Unknown=0, NotChecked=0, Total=18632 [2022-04-15 07:03:52,495 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7114 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 7114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:03:52,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 108 Invalid, 7237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 7114 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 07:03:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 07:03:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-15 07:03:52,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:03:52,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,876 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,876 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:52,877 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-15 07:03:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 07:03:52,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:52,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:52,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-15 07:03:52,878 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-15 07:03:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:03:52,879 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-15 07:03:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 07:03:52,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:03:52,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:03:52,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:03:52,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:03:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-15 07:03:52,880 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 129 [2022-04-15 07:03:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:03:52,881 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-15 07:03:52,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.953125) internal successors, (125), 63 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:03:52,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-15 07:03:53,002 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 07:03:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 07:03:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 07:03:53,002 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:03:53,002 INFO L499 BasicCegarLoop]: trace histogram [60, 58, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:03:53,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-15 07:03:53,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-15 07:03:53,203 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:03:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:03:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1149086363, now seen corresponding path program 58 times [2022-04-15 07:03:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:03:53,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127714586] [2022-04-15 07:03:57,255 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:03:57,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:57,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:03:57,528 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:03:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1462887599, now seen corresponding path program 1 times [2022-04-15 07:03:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:03:57,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304174423] [2022-04-15 07:03:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:03:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:03:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:57,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {38879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-15 07:03:57,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-15 07:03:57,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-15 07:03:57,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:03:57,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {38879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-15 07:03:57,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-15 07:03:57,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-15 07:03:57,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-15 07:03:57,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38873#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:57,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {38873#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:57,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:03:57,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {38874#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38875#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:03:57,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {38875#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:03:57,639 INFO L272 TraceCheckUtils]: 10: Hoare triple {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:03:57,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {38877#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38878#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:03:57,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {38878#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {38869#false} is VALID [2022-04-15 07:03:57,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-15 07:03:57,639 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 07:03:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:03:57,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304174423] [2022-04-15 07:03:57,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304174423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:03:57,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104463656] [2022-04-15 07:03:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:03:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:03:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:03:57,641 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 07:03:57,642 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 07:03:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:57,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:03:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:03:57,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:03:57,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38868#true} is VALID [2022-04-15 07:03:57,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-15 07:03:57,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-15 07:03:57,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-15 07:03:57,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-15 07:03:57,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38898#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:03:57,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {38898#(and (<= main_~x~0 0) (= main_~y~0 500000))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:57,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:03:57,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {38902#(and (= main_~y~0 500000) (< main_~x~0 500001))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38909#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:03:57,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {38909#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38913#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:03:57,977 INFO L272 TraceCheckUtils]: 10: Hoare triple {38913#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:57,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:57,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {38921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38869#false} is VALID [2022-04-15 07:03:57,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-15 07:03:57,978 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 07:03:57,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:03:58,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {38869#false} assume !false; {38869#false} is VALID [2022-04-15 07:03:58,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {38921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38869#false} is VALID [2022-04-15 07:03:58,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:03:58,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {38917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:03:58,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {38940#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [276] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {38876#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:03:58,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [279] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2755 v_main_~x~0_2754)) (.cse2 (<= 500000 v_main_~x~0_2755))) (or (and (= v_main_~y~0_2173 v_main_~y~0_2172) .cse0) (let ((.cse1 (+ v_main_~x~0_2755 v_main_~y~0_2172))) (and (< .cse1 (+ 1000001 v_main_~y~0_2173)) (= (+ v_main_~x~0_2754 v_main_~y~0_2173) .cse1) .cse2 (< v_main_~y~0_2173 v_main_~y~0_2172))) (and (= v_main_~y~0_2172 v_main_~y~0_2173) .cse0 (or (not .cse2) (not (< v_main_~x~0_2755 1000000)))))) InVars {main_~x~0=v_main_~x~0_2755, main_~y~0=v_main_~y~0_2173} OutVars{main_~x~0=v_main_~x~0_2754, main_~y~0=v_main_~y~0_2172} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {38940#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:03:58,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [278] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:03:58,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {38951#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [277] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2753 v_main_~x~0_2752))) (or (and (< v_main_~x~0_2752 500001) (< v_main_~x~0_2753 v_main_~x~0_2752)) .cse0 (and (<= 500000 v_main_~x~0_2753) .cse0))) InVars {main_~x~0=v_main_~x~0_2753} OutVars{main_~x~0=v_main_~x~0_2752} AuxVars[] AssignedVars[main_~x~0] {38944#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:03:58,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {38868#true} ~x~0 := 0;~y~0 := 500000; {38951#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:03:58,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {38868#true} call #t~ret4 := main(); {38868#true} is VALID [2022-04-15 07:03:58,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38868#true} {38868#true} #41#return; {38868#true} is VALID [2022-04-15 07:03:58,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {38868#true} assume true; {38868#true} is VALID [2022-04-15 07:03:58,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {38868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38868#true} is VALID [2022-04-15 07:03:58,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {38868#true} call ULTIMATE.init(); {38868#true} is VALID [2022-04-15 07:03:58,223 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 07:03:58,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104463656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:03:58,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:03:58,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:04:00,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127714586] [2022-04-15 07:04:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127714586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:00,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:00,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 07:04:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680063463] [2022-04-15 07:04:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:00,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:00,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:00,583 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 07:04:00,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 07:04:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 07:04:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=5444, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 07:04:00,584 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:12,675 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2022-04-15 07:04:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 07:04:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 147 transitions. [2022-04-15 07:04:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 147 transitions. [2022-04-15 07:04:12,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 147 transitions. [2022-04-15 07:04:12,801 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 07:04:12,802 INFO L225 Difference]: With dead ends: 142 [2022-04-15 07:04:12,802 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 07:04:12,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3550 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1231, Invalid=17951, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 07:04:12,803 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 7918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 7793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:12,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 258 Invalid, 7918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 07:04:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 07:04:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-15 07:04:13,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:13,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:13,111 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:13,111 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:13,112 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-15 07:04:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-15 07:04:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:13,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 07:04:13,112 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-15 07:04:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:13,113 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2022-04-15 07:04:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-15 07:04:13,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:13,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:13,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:13,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 130 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2022-04-15 07:04:13,120 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 131 [2022-04-15 07:04:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:13,120 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2022-04-15 07:04:13,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 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 07:04:13,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 138 transitions. [2022-04-15 07:04:13,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-15 07:04:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 07:04:13,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:13,215 INFO L499 BasicCegarLoop]: trace histogram [61, 59, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:13,233 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 07:04:13,433 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,SelfDestructingSolverStorable60 [2022-04-15 07:04:13,433 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 701832630, now seen corresponding path program 59 times [2022-04-15 07:04:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:13,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [303520466] [2022-04-15 07:04:13,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:13,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:13,704 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -782547537, now seen corresponding path program 1 times [2022-04-15 07:04:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081678744] [2022-04-15 07:04:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:13,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {39989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-15 07:04:13,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-15 07:04:13,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-15 07:04:13,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:13,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {39989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-15 07:04:13,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-15 07:04:13,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-15 07:04:13,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-15 07:04:13,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {39983#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:13,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {39983#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:13,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:13,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {39984#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {39985#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:13,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {39985#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:13,816 INFO L272 TraceCheckUtils]: 10: Hoare triple {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {39987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:04:13,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {39987#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39988#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:04:13,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {39988#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39979#false} is VALID [2022-04-15 07:04:13,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-15 07:04:13,817 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 07:04:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081678744] [2022-04-15 07:04:13,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081678744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:04:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013615498] [2022-04-15 07:04:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:13,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:04:13,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:04:13,818 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 07:04:13,819 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 07:04:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:13,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:04:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:13,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:04:14,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39978#true} is VALID [2022-04-15 07:04:14,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-15 07:04:14,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-15 07:04:14,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-15 07:04:14,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-15 07:04:14,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {40008#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:04:14,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {40008#(and (<= main_~x~0 0) (= main_~y~0 500000))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:14,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:14,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {40012#(and (= main_~y~0 500000) (< main_~x~0 500001))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {40019#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:14,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {40019#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {40023#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:14,260 INFO L272 TraceCheckUtils]: 10: Hoare triple {40023#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:14,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:14,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {40031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39979#false} is VALID [2022-04-15 07:04:14,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-15 07:04:14,261 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 07:04:14,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:04:14,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {39979#false} assume !false; {39979#false} is VALID [2022-04-15 07:04:14,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {40031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39979#false} is VALID [2022-04-15 07:04:14,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:14,582 INFO L272 TraceCheckUtils]: 10: Hoare triple {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {40027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:14,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {40050#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [280] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {39986#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:14,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [283] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2832)) (.cse2 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (let ((.cse0 (+ v_main_~x~0_2832 v_main_~y~0_2239))) (and (< .cse0 (+ 1000001 v_main_~y~0_2240)) (= .cse0 (+ v_main_~x~0_2831 v_main_~y~0_2240)) .cse1 (< v_main_~y~0_2240 v_main_~y~0_2239))) (and (= v_main_~y~0_2239 v_main_~y~0_2240) .cse2 (or (not .cse1) (not (< v_main_~x~0_2832 1000000)))) (and (= v_main_~y~0_2240 v_main_~y~0_2239) .cse2))) InVars {main_~x~0=v_main_~x~0_2832, main_~y~0=v_main_~y~0_2240} OutVars{main_~x~0=v_main_~x~0_2831, main_~y~0=v_main_~y~0_2239} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {40050#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:14,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [282] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:14,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {40061#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [281] L11-2-->L10-2_primed: Formula: (or (= v_main_~x~0_2830 v_main_~x~0_2829) (and (not (< v_main_~x~0_2830 500000)) (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829))) InVars {main_~x~0=v_main_~x~0_2830} OutVars{main_~x~0=v_main_~x~0_2829} AuxVars[] AssignedVars[main_~x~0] {40054#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:14,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {39978#true} ~x~0 := 0;~y~0 := 500000; {40061#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:14,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {39978#true} call #t~ret4 := main(); {39978#true} is VALID [2022-04-15 07:04:14,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39978#true} {39978#true} #41#return; {39978#true} is VALID [2022-04-15 07:04:14,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {39978#true} assume true; {39978#true} is VALID [2022-04-15 07:04:14,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {39978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39978#true} is VALID [2022-04-15 07:04:14,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {39978#true} call ULTIMATE.init(); {39978#true} is VALID [2022-04-15 07:04:14,585 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 07:04:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013615498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:04:14,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:04:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:04:17,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:17,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [303520466] [2022-04-15 07:04:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [303520466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:17,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:17,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 07:04:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186189280] [2022-04-15 07:04:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 07:04:17,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:17,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:17,680 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 07:04:17,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 07:04:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 07:04:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=5592, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 07:04:17,682 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:27,854 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-15 07:04:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 07:04:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 07:04:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 149 transitions. [2022-04-15 07:04:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 149 transitions. [2022-04-15 07:04:27,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 149 transitions. [2022-04-15 07:04:27,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:27,940 INFO L225 Difference]: With dead ends: 144 [2022-04-15 07:04:27,940 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 07:04:27,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3638 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1250, Invalid=18490, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 07:04:27,941 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 129 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7526 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 7653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 7526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:27,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 78 Invalid, 7653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 7526 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 07:04:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 07:04:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-15 07:04:28,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:28,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:28,187 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:28,188 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:28,189 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-15 07:04:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-15 07:04:28,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:28,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:28,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 07:04:28,189 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 137 states. [2022-04-15 07:04:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:28,190 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-15 07:04:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-15 07:04:28,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:28,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:28,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:28,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 132 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-04-15 07:04:28,191 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 133 [2022-04-15 07:04:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:28,192 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-04-15 07:04:28,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 65 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:28,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 140 transitions. [2022-04-15 07:04:28,280 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 07:04:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-15 07:04:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 07:04:28,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:28,281 INFO L499 BasicCegarLoop]: trace histogram [62, 60, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:28,299 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 07:04:28,497 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,SelfDestructingSolverStorable61 [2022-04-15 07:04:28,497 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 387724817, now seen corresponding path program 60 times [2022-04-15 07:04:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:28,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189316881] [2022-04-15 07:04:32,259 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:04:32,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:32,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:32,464 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1266984623, now seen corresponding path program 1 times [2022-04-15 07:04:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:32,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855263717] [2022-04-15 07:04:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:32,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {41114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-15 07:04:32,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-15 07:04:32,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-15 07:04:32,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:32,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {41114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-15 07:04:32,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-15 07:04:32,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-15 07:04:32,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-15 07:04:32,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41108#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:32,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {41108#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:32,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:32,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {41109#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41110#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:32,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {41110#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:32,574 INFO L272 TraceCheckUtils]: 10: Hoare triple {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:04:32,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {41112#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:04:32,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {41113#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {41104#false} is VALID [2022-04-15 07:04:32,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-15 07:04:32,574 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 07:04:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855263717] [2022-04-15 07:04:32,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855263717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:04:32,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143716935] [2022-04-15 07:04:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:32,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:04:32,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:04:32,580 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 07:04:32,580 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 07:04:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:32,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:04:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:32,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:04:32,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41103#true} is VALID [2022-04-15 07:04:32,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-15 07:04:32,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-15 07:04:32,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-15 07:04:32,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-15 07:04:32,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41133#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:04:32,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {41133#(and (<= main_~x~0 0) (= main_~y~0 500000))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:32,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:32,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {41137#(and (= main_~y~0 500000) (< main_~x~0 500001))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41144#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:32,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {41144#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41148#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:32,986 INFO L272 TraceCheckUtils]: 10: Hoare triple {41148#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:32,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:32,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {41156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {41104#false} is VALID [2022-04-15 07:04:32,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-15 07:04:32,986 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 07:04:32,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:04:33,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {41104#false} assume !false; {41104#false} is VALID [2022-04-15 07:04:33,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {41156#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {41104#false} is VALID [2022-04-15 07:04:33,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {41156#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:33,325 INFO L272 TraceCheckUtils]: 10: Hoare triple {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {41152#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:33,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {41175#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [284] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {41111#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:33,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [287] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2910)) (.cse1 (= v_main_~y~0_2308 v_main_~y~0_2307))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) (or (not .cse0) (not (< v_main_~x~0_2910 1000000))) .cse1) (and (< v_main_~x~0_2909 1000001) (= (+ v_main_~x~0_2909 v_main_~y~0_2308) (+ v_main_~x~0_2910 v_main_~y~0_2307)) .cse0 (< v_main_~x~0_2910 v_main_~x~0_2909)) (and (= v_main_~x~0_2910 v_main_~x~0_2909) .cse1))) InVars {main_~x~0=v_main_~x~0_2910, main_~y~0=v_main_~y~0_2308} OutVars{main_~x~0=v_main_~x~0_2909, main_~y~0=v_main_~y~0_2307} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {41175#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:33,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [286] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:33,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {41186#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [285] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2908 v_main_~x~0_2907))) (or (and .cse0 (not (< v_main_~x~0_2908 500000))) .cse0 (and (< v_main_~x~0_2908 v_main_~x~0_2907) (< v_main_~x~0_2907 500001)))) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2907} AuxVars[] AssignedVars[main_~x~0] {41179#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:33,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {41103#true} ~x~0 := 0;~y~0 := 500000; {41186#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:33,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {41103#true} call #t~ret4 := main(); {41103#true} is VALID [2022-04-15 07:04:33,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41103#true} {41103#true} #41#return; {41103#true} is VALID [2022-04-15 07:04:33,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {41103#true} assume true; {41103#true} is VALID [2022-04-15 07:04:33,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {41103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41103#true} is VALID [2022-04-15 07:04:33,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {41103#true} call ULTIMATE.init(); {41103#true} is VALID [2022-04-15 07:04:33,328 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 07:04:33,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143716935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:04:33,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:04:33,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:04:35,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:35,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189316881] [2022-04-15 07:04:35,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189316881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 07:04:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666576831] [2022-04-15 07:04:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 07:04:35,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:35,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:35,960 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 07:04:35,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 07:04:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:35,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 07:04:35,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=5742, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 07:04:35,961 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:48,521 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2022-04-15 07:04:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 07:04:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 07:04:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:04:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 151 transitions. [2022-04-15 07:04:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 151 transitions. [2022-04-15 07:04:48,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 151 transitions. [2022-04-15 07:04:48,643 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 07:04:48,645 INFO L225 Difference]: With dead ends: 146 [2022-04-15 07:04:48,645 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 07:04:48,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3727 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1269, Invalid=19037, Unknown=0, NotChecked=0, Total=20306 [2022-04-15 07:04:48,646 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8327 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 8456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 8327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:04:48,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 278 Invalid, 8456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 8327 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 07:04:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 07:04:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-15 07:04:48,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:04:48,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,955 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,955 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:48,956 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-15 07:04:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-15 07:04:48,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:48,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:48,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 07:04:48,957 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 07:04:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:04:48,958 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-15 07:04:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-15 07:04:48,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:04:48,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:04:48,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:04:48,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:04:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2022-04-15 07:04:48,959 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 135 [2022-04-15 07:04:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:04:48,959 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2022-04-15 07:04:48,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 66 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:04:48,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 142 transitions. [2022-04-15 07:04:49,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:04:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-15 07:04:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 07:04:49,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:04:49,051 INFO L499 BasicCegarLoop]: trace histogram [63, 61, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:04:49,067 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 07:04:49,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:04:49,267 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:04:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:04:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -822172756, now seen corresponding path program 61 times [2022-04-15 07:04:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:49,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521455613] [2022-04-15 07:04:49,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:49,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:04:49,539 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:04:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash -978450513, now seen corresponding path program 1 times [2022-04-15 07:04:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:04:49,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016158441] [2022-04-15 07:04:49,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:04:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:04:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:49,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {42254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-15 07:04:49,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-15 07:04:49,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-15 07:04:49,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:04:49,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {42254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-15 07:04:49,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-15 07:04:49,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-15 07:04:49,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-15 07:04:49,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42248#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:49,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {42248#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:49,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:04:49,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {42249#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42250#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} is VALID [2022-04-15 07:04:49,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {42250#(or (and (< main_~x~0 (+ main_~y~0 1)) (or (<= main_~y~0 1000000) (<= main_~y~0 main_~x~0))) (<= main_~x~0 500000))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:49,612 INFO L272 TraceCheckUtils]: 10: Hoare triple {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42252#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:04:49,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {42252#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {42253#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:04:49,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {42253#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42244#false} is VALID [2022-04-15 07:04:49,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-15 07:04:49,612 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 07:04:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:04:49,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016158441] [2022-04-15 07:04:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016158441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:04:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457323177] [2022-04-15 07:04:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:04:49,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:04:49,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:04:49,614 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 07:04:49,614 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 07:04:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:49,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:04:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:04:49,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:04:49,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42243#true} is VALID [2022-04-15 07:04:49,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-15 07:04:49,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-15 07:04:49,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-15 07:04:49,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-15 07:04:49,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42273#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:04:49,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {42273#(and (<= main_~x~0 0) (= main_~y~0 500000))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:49,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:04:49,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {42277#(and (= main_~y~0 500000) (< main_~x~0 500001))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42284#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:49,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {42284#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42288#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:49,947 INFO L272 TraceCheckUtils]: 10: Hoare triple {42288#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:49,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:49,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {42296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42244#false} is VALID [2022-04-15 07:04:49,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-15 07:04:49,948 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 07:04:49,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:04:50,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {42244#false} assume !false; {42244#false} is VALID [2022-04-15 07:04:50,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {42296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42244#false} is VALID [2022-04-15 07:04:50,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:04:50,164 INFO L272 TraceCheckUtils]: 10: Hoare triple {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {42292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:04:50,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {42315#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [288] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {42251#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:04:50,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [291] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2989)) (.cse0 (= v_main_~y~0_2377 v_main_~y~0_2376)) (.cse1 (= v_main_~x~0_2989 v_main_~x~0_2988))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2989 1000000)))) (let ((.cse3 (+ v_main_~x~0_2989 v_main_~y~0_2376))) (and (= .cse3 (+ v_main_~x~0_2988 v_main_~y~0_2377)) .cse2 (< .cse3 (+ 1000001 v_main_~y~0_2377)) (< v_main_~y~0_2377 v_main_~y~0_2376))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2989, main_~y~0=v_main_~y~0_2377} OutVars{main_~x~0=v_main_~x~0_2988, main_~y~0=v_main_~y~0_2376} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {42315#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:50,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [290] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:50,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {42326#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [289] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_2987 v_main_~x~0_2986))) (or .cse0 (and .cse0 (not (< v_main_~x~0_2987 500000))) (and (< v_main_~x~0_2987 v_main_~x~0_2986) (< v_main_~x~0_2986 500001)))) InVars {main_~x~0=v_main_~x~0_2987} OutVars{main_~x~0=v_main_~x~0_2986} AuxVars[] AssignedVars[main_~x~0] {42319#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:04:50,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {42243#true} ~x~0 := 0;~y~0 := 500000; {42326#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:04:50,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {42243#true} call #t~ret4 := main(); {42243#true} is VALID [2022-04-15 07:04:50,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42243#true} {42243#true} #41#return; {42243#true} is VALID [2022-04-15 07:04:50,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {42243#true} assume true; {42243#true} is VALID [2022-04-15 07:04:50,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {42243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42243#true} is VALID [2022-04-15 07:04:50,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {42243#true} call ULTIMATE.init(); {42243#true} is VALID [2022-04-15 07:04:50,167 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 07:04:50,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457323177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:04:50,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:04:50,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:04:53,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:04:53,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521455613] [2022-04-15 07:04:53,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521455613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:04:53,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:04:53,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 07:04:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844337198] [2022-04-15 07:04:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:04:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:04:53,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:04:53,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:04:53,693 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 07:04:53,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 07:04:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:04:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 07:04:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=5894, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 07:04:53,694 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:05:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:06,931 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2022-04-15 07:05:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 07:05:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:05:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:05:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 153 transitions. [2022-04-15 07:05:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:05:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 153 transitions. [2022-04-15 07:05:06,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 153 transitions. [2022-04-15 07:05:07,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:07,027 INFO L225 Difference]: With dead ends: 148 [2022-04-15 07:05:07,028 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 07:05:07,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3817 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1288, Invalid=19592, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 07:05:07,032 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 133 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 8591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 8460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:07,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 278 Invalid, 8591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 8460 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 07:05:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 07:05:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-04-15 07:05:07,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:07,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:07,333 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:07,333 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:07,334 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-15 07:05:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 07:05:07,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:07,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:07,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 07:05:07,335 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 07:05:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:07,337 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-15 07:05:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 07:05:07,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:07,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:07,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:07,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2022-04-15 07:05:07,340 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 137 [2022-04-15 07:05:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:07,340 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2022-04-15 07:05:07,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 67 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 07:05:07,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 144 transitions. [2022-04-15 07:05:07,466 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 07:05:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 07:05:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 07:05:07,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:07,467 INFO L499 BasicCegarLoop]: trace histogram [64, 62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:07,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-15 07:05:07,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:05:07,667 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 402396807, now seen corresponding path program 62 times [2022-04-15 07:05:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820222222] [2022-04-15 07:05:11,719 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:05:11,760 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:11,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:11,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1071081647, now seen corresponding path program 1 times [2022-04-15 07:05:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020478277] [2022-04-15 07:05:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:12,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {43409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-15 07:05:12,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-15 07:05:12,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-15 07:05:12,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:12,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {43409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-15 07:05:12,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-15 07:05:12,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-15 07:05:12,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-15 07:05:12,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:05:12,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {43403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:12,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:12,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {43404#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43405#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:12,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {43405#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43406#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0) (not (= main_~x~0 0)))} is VALID [2022-04-15 07:05:12,064 INFO L272 TraceCheckUtils]: 10: Hoare triple {43406#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0) (not (= main_~x~0 0)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43407#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:05:12,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {43407#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {43408#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:05:12,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {43408#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43399#false} is VALID [2022-04-15 07:05:12,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-15 07:05:12,065 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 07:05:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020478277] [2022-04-15 07:05:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020478277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:05:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471235055] [2022-04-15 07:05:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:05:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:05:12,066 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:05:12,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-15 07:05:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:12,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:05:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:12,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:05:12,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43398#true} is VALID [2022-04-15 07:05:12,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-15 07:05:12,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-15 07:05:12,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-15 07:05:12,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-15 07:05:12,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43428#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:05:12,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {43428#(and (<= main_~x~0 0) (= main_~y~0 500000))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:12,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:12,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {43432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:12,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {43439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:12,448 INFO L272 TraceCheckUtils]: 10: Hoare triple {43443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:12,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:12,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {43451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {43399#false} is VALID [2022-04-15 07:05:12,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-15 07:05:12,449 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 07:05:12,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:05:13,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {43399#false} assume !false; {43399#false} is VALID [2022-04-15 07:05:13,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {43451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {43399#false} is VALID [2022-04-15 07:05:13,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:13,031 INFO L272 TraceCheckUtils]: 10: Hoare triple {43467#(= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {43447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:13,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {43471#(or (< main_~x~0 1000000) (= main_~y~0 main_~x~0))} [292] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {43467#(= main_~y~0 main_~x~0)} is VALID [2022-04-15 07:05:13,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [295] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3069 v_main_~x~0_3068)) (.cse2 (<= 500000 v_main_~x~0_3069)) (.cse1 (= v_main_~y~0_2447 v_main_~y~0_2446))) (or (and .cse0 .cse1) (and .cse2 (< v_main_~x~0_3069 v_main_~x~0_3068) (= (+ v_main_~x~0_3068 v_main_~y~0_2447) (+ v_main_~x~0_3069 v_main_~y~0_2446)) (< v_main_~x~0_3068 1000001)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3069 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_3069, main_~y~0=v_main_~y~0_2447} OutVars{main_~x~0=v_main_~x~0_3068, main_~y~0=v_main_~y~0_2446} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {43471#(or (< main_~x~0 1000000) (= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:13,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [294] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-15 07:05:13,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {43482#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (and (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (<= 500000 main_~y~0) (<= v_main_~x~0_3078 (+ main_~x~0 1)))) (not (< v_main_~x~0_3078 1000001))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} [293] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3067 v_main_~x~0_3066))) (or .cse0 (and (< v_main_~x~0_3067 v_main_~x~0_3066) (< v_main_~x~0_3066 500001)) (and (<= 500000 v_main_~x~0_3067) .cse0))) InVars {main_~x~0=v_main_~x~0_3067} OutVars{main_~x~0=v_main_~x~0_3066} AuxVars[] AssignedVars[main_~x~0] {43475#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-15 07:05:13,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {43398#true} ~x~0 := 0;~y~0 := 500000; {43482#(forall ((v_main_~x~0_3078 Int)) (or (< v_main_~x~0_3078 1000000) (and (or (= v_main_~x~0_3078 (+ v_main_~x~0_3078 main_~y~0 (* (- 1) main_~x~0))) (not (< v_main_~x~0_3078 1000001)) (not (<= 500000 main_~x~0)) (not (< main_~x~0 v_main_~x~0_3078))) (or (and (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (<= 500000 main_~y~0) (<= v_main_~x~0_3078 (+ main_~x~0 1)))) (not (< v_main_~x~0_3078 1000001))) (or (not (= v_main_~x~0_3078 main_~x~0)) (= v_main_~x~0_3078 main_~y~0)))))} is VALID [2022-04-15 07:05:13,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {43398#true} call #t~ret4 := main(); {43398#true} is VALID [2022-04-15 07:05:13,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43398#true} {43398#true} #41#return; {43398#true} is VALID [2022-04-15 07:05:13,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {43398#true} assume true; {43398#true} is VALID [2022-04-15 07:05:13,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {43398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43398#true} is VALID [2022-04-15 07:05:13,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {43398#true} call ULTIMATE.init(); {43398#true} is VALID [2022-04-15 07:05:13,035 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 07:05:13,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471235055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:05:13,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:05:13,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-15 07:05:15,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:15,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820222222] [2022-04-15 07:05:15,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820222222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:15,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:15,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 07:05:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359185688] [2022-04-15 07:05:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 07:05:15,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:15,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:16,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:16,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 07:05:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 07:05:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6143, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:05:16,094 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:29,530 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2022-04-15 07:05:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 07:05:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 07:05:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 155 transitions. [2022-04-15 07:05:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 155 transitions. [2022-04-15 07:05:29,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 155 transitions. [2022-04-15 07:05:29,642 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 07:05:29,643 INFO L225 Difference]: With dead ends: 150 [2022-04-15 07:05:29,643 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 07:05:29,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4041 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1439, Invalid=20317, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 07:05:29,645 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 135 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 8669 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 8802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 8669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:29,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 258 Invalid, 8802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 8669 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 07:05:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 07:05:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-04-15 07:05:29,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:29,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,948 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,948 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:29,950 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 07:05:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-15 07:05:29,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:29,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:29,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-15 07:05:29,950 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-15 07:05:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:29,951 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 07:05:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-15 07:05:29,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:29,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:29,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:29,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2022-04-15 07:05:29,953 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 139 [2022-04-15 07:05:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:29,953 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2022-04-15 07:05:29,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 68 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:29,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 146 transitions. [2022-04-15 07:05:30,064 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 07:05:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-15 07:05:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 07:05:30,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:30,065 INFO L499 BasicCegarLoop]: trace histogram [65, 63, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:30,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-15 07:05:30,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-15 07:05:30,281 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 392707746, now seen corresponding path program 63 times [2022-04-15 07:05:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:30,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296274539] [2022-04-15 07:05:34,332 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:05:34,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:34,583 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:34,585 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1174353489, now seen corresponding path program 1 times [2022-04-15 07:05:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:34,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156171625] [2022-04-15 07:05:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:34,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {44580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-15 07:05:34,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-15 07:05:34,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-15 07:05:34,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:34,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {44580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-15 07:05:34,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-15 07:05:34,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-15 07:05:34,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-15 07:05:34,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44574#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:05:34,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {44574#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:34,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:34,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {44575#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44576#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:34,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {44576#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:34,664 INFO L272 TraceCheckUtils]: 10: Hoare triple {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44578#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:05:34,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {44578#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {44579#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:05:34,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {44579#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44570#false} is VALID [2022-04-15 07:05:34,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-15 07:05:34,664 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 07:05:34,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156171625] [2022-04-15 07:05:34,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156171625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:05:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812961460] [2022-04-15 07:05:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:34,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:05:34,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:05:34,665 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:05:34,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-15 07:05:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:34,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:05:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:34,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:05:34,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44569#true} is VALID [2022-04-15 07:05:34,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-15 07:05:34,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-15 07:05:34,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-15 07:05:34,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-15 07:05:34,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44599#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:05:34,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {44599#(and (<= main_~x~0 0) (= main_~y~0 500000))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:34,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:35,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {44603#(and (= main_~y~0 500000) (< main_~x~0 500001))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44610#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:35,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {44610#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44614#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:35,001 INFO L272 TraceCheckUtils]: 10: Hoare triple {44614#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:35,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:35,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {44622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44570#false} is VALID [2022-04-15 07:05:35,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-15 07:05:35,002 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 07:05:35,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:05:35,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {44570#false} assume !false; {44570#false} is VALID [2022-04-15 07:05:35,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {44622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {44570#false} is VALID [2022-04-15 07:05:35,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {44622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:35,236 INFO L272 TraceCheckUtils]: 10: Hoare triple {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {44618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:35,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {44641#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [296] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {44577#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:35,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [299] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3150 v_main_~x~0_3149)) (.cse2 (= v_main_~y~0_2518 v_main_~y~0_2517)) (.cse0 (<= 500000 v_main_~x~0_3150))) (or (and (or (not (< v_main_~x~0_3150 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3150 v_main_~y~0_2517))) (and (< .cse3 (+ 1000001 v_main_~y~0_2518)) (= (+ v_main_~x~0_3149 v_main_~y~0_2518) .cse3) (< v_main_~y~0_2518 v_main_~y~0_2517) .cse0)))) InVars {main_~x~0=v_main_~x~0_3150, main_~y~0=v_main_~y~0_2518} OutVars{main_~x~0=v_main_~x~0_3149, main_~y~0=v_main_~y~0_2517} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {44641#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:35,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [298] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:35,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {44652#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} [297] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3148 v_main_~x~0_3147))) (or (and (<= 500000 v_main_~x~0_3148) .cse0) (and (< v_main_~x~0_3148 v_main_~x~0_3147) (< v_main_~x~0_3147 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3148} OutVars{main_~x~0=v_main_~x~0_3147} AuxVars[] AssignedVars[main_~x~0] {44645#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:35,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {44569#true} ~x~0 := 0;~y~0 := 500000; {44652#(and (< main_~x~0 (+ main_~y~0 1)) (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)) (or (not (<= 500000 main_~x~0)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:35,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {44569#true} call #t~ret4 := main(); {44569#true} is VALID [2022-04-15 07:05:35,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44569#true} {44569#true} #41#return; {44569#true} is VALID [2022-04-15 07:05:35,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {44569#true} assume true; {44569#true} is VALID [2022-04-15 07:05:35,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {44569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44569#true} is VALID [2022-04-15 07:05:35,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {44569#true} call ULTIMATE.init(); {44569#true} is VALID [2022-04-15 07:05:35,239 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 07:05:35,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812961460] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:05:35,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:05:35,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:05:38,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296274539] [2022-04-15 07:05:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296274539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:38,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-15 07:05:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024116128] [2022-04-15 07:05:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 07:05:38,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:38,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:38,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:38,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-15 07:05:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-15 07:05:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=6204, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:05:38,686 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:51,187 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-04-15 07:05:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 07:05:51,187 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 07:05:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:05:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2022-04-15 07:05:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 157 transitions. [2022-04-15 07:05:51,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 157 transitions. [2022-04-15 07:05:51,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:51,284 INFO L225 Difference]: With dead ends: 152 [2022-04-15 07:05:51,285 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 07:05:51,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4000 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1326, Invalid=20726, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 07:05:51,286 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8597 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 8597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:05:51,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 53 Invalid, 8732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 8597 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 07:05:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 07:05:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-04-15 07:05:51,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:05:51,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,557 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,557 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:51,558 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-04-15 07:05:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-15 07:05:51,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:51,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:51,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 07:05:51,559 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 07:05:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:05:51,560 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-04-15 07:05:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-15 07:05:51,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:05:51,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:05:51,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:05:51,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:05:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2022-04-15 07:05:51,561 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 141 [2022-04-15 07:05:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:05:51,561 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2022-04-15 07:05:51,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.957142857142857) internal successors, (137), 69 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:51,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 148 transitions. [2022-04-15 07:05:51,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2022-04-15 07:05:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 07:05:51,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:05:51,656 INFO L499 BasicCegarLoop]: trace histogram [66, 64, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:05:51,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-15 07:05:51,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-15 07:05:51,873 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:05:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:05:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -328545283, now seen corresponding path program 64 times [2022-04-15 07:05:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:51,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181967745] [2022-04-15 07:05:51,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:52,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:05:52,144 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:05:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 875178671, now seen corresponding path program 1 times [2022-04-15 07:05:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:05:52,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235880321] [2022-04-15 07:05:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:05:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:05:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:52,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {45765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-15 07:05:52,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-15 07:05:52,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-15 07:05:52,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:05:52,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {45765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-15 07:05:52,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-15 07:05:52,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-15 07:05:52,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-15 07:05:52,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45759#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:05:52,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {45759#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:52,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:52,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {45760#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45761#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:52,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {45761#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:52,227 INFO L272 TraceCheckUtils]: 10: Hoare triple {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:05:52,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {45763#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45764#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:05:52,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {45764#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {45755#false} is VALID [2022-04-15 07:05:52,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-15 07:05:52,227 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 07:05:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:05:52,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235880321] [2022-04-15 07:05:52,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235880321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:05:52,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795456082] [2022-04-15 07:05:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:05:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:05:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:05:52,229 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:05:52,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-15 07:05:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:52,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:05:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:05:52,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:05:52,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45754#true} is VALID [2022-04-15 07:05:52,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-15 07:05:52,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-15 07:05:52,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-15 07:05:52,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-15 07:05:52,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45784#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:05:52,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {45784#(and (<= main_~x~0 0) (= main_~y~0 500000))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:52,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:05:52,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {45788#(and (= main_~y~0 500000) (< main_~x~0 500001))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45795#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:52,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {45795#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45799#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:52,500 INFO L272 TraceCheckUtils]: 10: Hoare triple {45799#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:52,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:52,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {45807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45755#false} is VALID [2022-04-15 07:05:52,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-15 07:05:52,501 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 07:05:52,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:05:52,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {45755#false} assume !false; {45755#false} is VALID [2022-04-15 07:05:52,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {45807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45755#false} is VALID [2022-04-15 07:05:52,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:05:52,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {45803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:05:52,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {45826#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [300] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {45762#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:05:52,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [303] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3232 v_main_~x~0_3231)) (.cse1 (= v_main_~y~0_2590 v_main_~y~0_2589)) (.cse2 (<= 500000 v_main_~x~0_3232))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_3232 1000000))) .cse1) (and (< v_main_~x~0_3232 v_main_~x~0_3231) (< v_main_~x~0_3231 1000001) (= (+ v_main_~x~0_3232 v_main_~y~0_2589) (+ v_main_~x~0_3231 v_main_~y~0_2590)) .cse2))) InVars {main_~x~0=v_main_~x~0_3232, main_~y~0=v_main_~y~0_2590} OutVars{main_~x~0=v_main_~x~0_3231, main_~y~0=v_main_~y~0_2589} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {45826#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:52,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [302] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:52,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {45837#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [301] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3230 v_main_~x~0_3229))) (or (and (<= 500000 v_main_~x~0_3230) .cse0) (and (< v_main_~x~0_3230 v_main_~x~0_3229) (< v_main_~x~0_3229 500001)) .cse0)) InVars {main_~x~0=v_main_~x~0_3230} OutVars{main_~x~0=v_main_~x~0_3229} AuxVars[] AssignedVars[main_~x~0] {45830#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:05:52,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {45754#true} ~x~0 := 0;~y~0 := 500000; {45837#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:05:52,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {45754#true} call #t~ret4 := main(); {45754#true} is VALID [2022-04-15 07:05:52,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45754#true} {45754#true} #41#return; {45754#true} is VALID [2022-04-15 07:05:52,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {45754#true} assume true; {45754#true} is VALID [2022-04-15 07:05:52,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {45754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45754#true} is VALID [2022-04-15 07:05:52,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {45754#true} call ULTIMATE.init(); {45754#true} is VALID [2022-04-15 07:05:52,797 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 07:05:52,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795456082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:05:52,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:05:52,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:05:56,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:05:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181967745] [2022-04-15 07:05:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181967745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:05:56,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:05:56,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 07:05:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371117868] [2022-04-15 07:05:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:05:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 07:05:56,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:05:56,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:05:56,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:05:56,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 07:05:56,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:05:56,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 07:05:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=6362, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 07:05:56,205 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:09,341 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2022-04-15 07:06:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-15 07:06:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-15 07:06:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:06:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 159 transitions. [2022-04-15 07:06:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 159 transitions. [2022-04-15 07:06:09,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 159 transitions. [2022-04-15 07:06:09,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:09,444 INFO L225 Difference]: With dead ends: 154 [2022-04-15 07:06:09,445 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 07:06:09,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1345, Invalid=21305, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 07:06:09,447 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 139 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9132 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 9269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 9132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:06:09,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 233 Invalid, 9269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 9132 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 07:06:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 07:06:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-04-15 07:06:09,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:06:09,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,798 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,798 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:09,799 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2022-04-15 07:06:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-15 07:06:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:09,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:09,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-15 07:06:09,800 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 147 states. [2022-04-15 07:06:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:09,801 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2022-04-15 07:06:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-15 07:06:09,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:09,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:09,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:06:09,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:06:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2022-04-15 07:06:09,802 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 143 [2022-04-15 07:06:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:06:09,803 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2022-04-15 07:06:09,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 70 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:09,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 150 transitions. [2022-04-15 07:06:09,936 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 07:06:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-15 07:06:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 07:06:09,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:06:09,937 INFO L499 BasicCegarLoop]: trace histogram [67, 65, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:06:09,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-15 07:06:10,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:06:10,137 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:06:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:06:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1962971496, now seen corresponding path program 65 times [2022-04-15 07:06:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:10,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891246338] [2022-04-15 07:06:10,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:14,340 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:06:14,442 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:14,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1370256465, now seen corresponding path program 1 times [2022-04-15 07:06:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:14,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203728411] [2022-04-15 07:06:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:14,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {46965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-15 07:06:14,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-15 07:06:14,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-15 07:06:14,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:14,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {46965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-15 07:06:14,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-15 07:06:14,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-15 07:06:14,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-15 07:06:14,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {46959#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:14,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {46959#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:06:14,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:06:14,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {46960#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:14,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:14,540 INFO L272 TraceCheckUtils]: 10: Hoare triple {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {46963#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:06:14,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {46963#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {46964#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:06:14,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {46964#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {46955#false} is VALID [2022-04-15 07:06:14,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-15 07:06:14,540 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 07:06:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203728411] [2022-04-15 07:06:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203728411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:06:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786161305] [2022-04-15 07:06:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:14,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:06:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:06:14,542 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:06:14,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-15 07:06:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:14,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:06:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:14,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:06:14,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46954#true} is VALID [2022-04-15 07:06:14,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-15 07:06:14,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-15 07:06:14,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-15 07:06:14,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-15 07:06:14,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {46984#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:06:14,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {46984#(and (<= main_~x~0 0) (= main_~y~0 500000))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:14,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:14,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {46988#(and (= main_~y~0 500000) (< main_~x~0 500001))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46995#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:06:14,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {46995#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46999#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:06:14,944 INFO L272 TraceCheckUtils]: 10: Hoare triple {46999#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:14,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:14,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {47007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46955#false} is VALID [2022-04-15 07:06:14,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-15 07:06:14,945 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 07:06:14,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:06:15,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {46955#false} assume !false; {46955#false} is VALID [2022-04-15 07:06:15,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {47007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46955#false} is VALID [2022-04-15 07:06:15,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:15,273 INFO L272 TraceCheckUtils]: 10: Hoare triple {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {47003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:15,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [304] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {46962#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:15,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [307] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_3315 v_main_~x~0_3314)) (.cse2 (= v_main_~y~0_2663 v_main_~y~0_2662)) (.cse0 (<= 500000 v_main_~x~0_3315))) (or (and (< v_main_~x~0_3315 v_main_~x~0_3314) .cse0 (< v_main_~x~0_3314 1000001) (= (+ v_main_~x~0_3314 v_main_~y~0_2663) (+ v_main_~x~0_3315 v_main_~y~0_2662))) (and .cse1 .cse2) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3315 1000000)))))) InVars {main_~x~0=v_main_~x~0_3315, main_~y~0=v_main_~y~0_2663} OutVars{main_~x~0=v_main_~x~0_3314, main_~y~0=v_main_~y~0_2662} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {46961#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:15,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [306] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:15,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {47036#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [305] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3313 v_main_~x~0_3312))) (or .cse0 (and .cse0 (not (< v_main_~x~0_3313 500000))) (and (< v_main_~x~0_3313 v_main_~x~0_3312) (< v_main_~x~0_3312 500001)))) InVars {main_~x~0=v_main_~x~0_3313} OutVars{main_~x~0=v_main_~x~0_3312} AuxVars[] AssignedVars[main_~x~0] {47029#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:15,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {46954#true} ~x~0 := 0;~y~0 := 500000; {47036#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:15,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {46954#true} call #t~ret4 := main(); {46954#true} is VALID [2022-04-15 07:06:15,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46954#true} {46954#true} #41#return; {46954#true} is VALID [2022-04-15 07:06:15,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {46954#true} assume true; {46954#true} is VALID [2022-04-15 07:06:15,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {46954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46954#true} is VALID [2022-04-15 07:06:15,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {46954#true} call ULTIMATE.init(); {46954#true} is VALID [2022-04-15 07:06:15,276 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 07:06:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786161305] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:06:15,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:06:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 07:06:18,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:06:18,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891246338] [2022-04-15 07:06:18,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891246338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:18,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:18,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-15 07:06:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692008358] [2022-04-15 07:06:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:06:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 07:06:18,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:06:18,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:18,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:18,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-15 07:06:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-15 07:06:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=6433, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 07:06:18,445 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:31,596 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2022-04-15 07:06:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 07:06:31,596 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 07:06:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:06:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 161 transitions. [2022-04-15 07:06:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 161 transitions. [2022-04-15 07:06:31,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 161 transitions. [2022-04-15 07:06:31,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:31,745 INFO L225 Difference]: With dead ends: 156 [2022-04-15 07:06:31,745 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 07:06:31,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4042 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1217, Invalid=21735, Unknown=0, NotChecked=0, Total=22952 [2022-04-15 07:06:31,747 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 141 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9078 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 9217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 9078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:06:31,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 88 Invalid, 9217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 9078 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 07:06:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 07:06:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-04-15 07:06:32,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:06:32,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,217 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,217 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:32,218 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2022-04-15 07:06:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2022-04-15 07:06:32,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:32,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:32,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 07:06:32,219 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-15 07:06:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:32,220 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2022-04-15 07:06:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2022-04-15 07:06:32,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:32,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:32,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:06:32,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:06:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2022-04-15 07:06:32,222 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 145 [2022-04-15 07:06:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:06:32,222 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2022-04-15 07:06:32,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 71 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:32,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 152 transitions. [2022-04-15 07:06:32,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2022-04-15 07:06:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 07:06:32,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:06:32,356 INFO L499 BasicCegarLoop]: trace histogram [68, 66, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:06:32,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-15 07:06:32,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-15 07:06:32,556 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:06:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:06:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -688531853, now seen corresponding path program 66 times [2022-04-15 07:06:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233616735] [2022-04-15 07:06:32,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:32,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:32,766 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 679275695, now seen corresponding path program 1 times [2022-04-15 07:06:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:32,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753140501] [2022-04-15 07:06:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:32,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {48179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {48168#true} assume true; {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48168#true} {48168#true} #41#return; {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {48168#true} call ULTIMATE.init(); {48179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:32,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {48179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {48168#true} assume true; {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48168#true} {48168#true} #41#return; {48168#true} is VALID [2022-04-15 07:06:32,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {48168#true} call #t~ret4 := main(); {48168#true} is VALID [2022-04-15 07:06:32,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {48168#true} ~x~0 := 0;~y~0 := 500000; {48173#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:32,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {48173#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [309] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3397 v_main_~x~0_3396))) (or (and (< v_main_~x~0_3396 500001) (< v_main_~x~0_3397 v_main_~x~0_3396)) .cse0 (and (not (< v_main_~x~0_3397 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3396} AuxVars[] AssignedVars[main_~x~0] {48174#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:32,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {48174#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [310] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48174#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:32,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {48174#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [311] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3399)) (.cse1 (= v_main_~y~0_2737 v_main_~y~0_2736)) (.cse2 (= v_main_~x~0_3399 v_main_~x~0_3398))) (or (and .cse0 (= (+ v_main_~x~0_3399 v_main_~y~0_2736) (+ v_main_~x~0_3398 v_main_~y~0_2737)) (< v_main_~x~0_3399 v_main_~x~0_3398) (< v_main_~x~0_3398 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3399 1000000)))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3399, main_~y~0=v_main_~y~0_2737} OutVars{main_~x~0=v_main_~x~0_3398, main_~y~0=v_main_~y~0_2736} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {48175#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:32,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {48175#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [308] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {48176#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:32,839 INFO L272 TraceCheckUtils]: 10: Hoare triple {48176#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {48177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:06:32,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {48177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {48178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:06:32,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {48178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48169#false} is VALID [2022-04-15 07:06:32,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {48169#false} assume !false; {48169#false} is VALID [2022-04-15 07:06:32,839 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 07:06:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:32,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753140501] [2022-04-15 07:06:32,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753140501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:06:32,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35687026] [2022-04-15 07:06:32,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:06:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:06:32,843 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:06:32,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-15 07:06:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:32,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:06:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:32,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:06:33,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {48168#true} call ULTIMATE.init(); {48168#true} is VALID [2022-04-15 07:06:33,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {48168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48168#true} is VALID [2022-04-15 07:06:33,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {48168#true} assume true; {48168#true} is VALID [2022-04-15 07:06:33,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48168#true} {48168#true} #41#return; {48168#true} is VALID [2022-04-15 07:06:33,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {48168#true} call #t~ret4 := main(); {48168#true} is VALID [2022-04-15 07:06:33,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {48168#true} ~x~0 := 0;~y~0 := 500000; {48198#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:06:33,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {48198#(and (<= main_~x~0 0) (= main_~y~0 500000))} [309] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3397 v_main_~x~0_3396))) (or (and (< v_main_~x~0_3396 500001) (< v_main_~x~0_3397 v_main_~x~0_3396)) .cse0 (and (not (< v_main_~x~0_3397 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3396} AuxVars[] AssignedVars[main_~x~0] {48202#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:33,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {48202#(and (= main_~y~0 500000) (< main_~x~0 500001))} [310] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48202#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:33,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {48202#(and (= main_~y~0 500000) (< main_~x~0 500001))} [311] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3399)) (.cse1 (= v_main_~y~0_2737 v_main_~y~0_2736)) (.cse2 (= v_main_~x~0_3399 v_main_~x~0_3398))) (or (and .cse0 (= (+ v_main_~x~0_3399 v_main_~y~0_2736) (+ v_main_~x~0_3398 v_main_~y~0_2737)) (< v_main_~x~0_3399 v_main_~x~0_3398) (< v_main_~x~0_3398 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3399 1000000)))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3399, main_~y~0=v_main_~y~0_2737} OutVars{main_~x~0=v_main_~x~0_3398, main_~y~0=v_main_~y~0_2736} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {48209#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:06:33,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {48209#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [308] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {48213#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:06:33,179 INFO L272 TraceCheckUtils]: 10: Hoare triple {48213#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {48217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:33,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {48217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:33,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {48221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48169#false} is VALID [2022-04-15 07:06:33,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {48169#false} assume !false; {48169#false} is VALID [2022-04-15 07:06:33,180 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 07:06:33,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:06:33,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {48169#false} assume !false; {48169#false} is VALID [2022-04-15 07:06:33,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {48221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48169#false} is VALID [2022-04-15 07:06:33,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {48217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:33,428 INFO L272 TraceCheckUtils]: 10: Hoare triple {48176#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {48217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:33,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {48240#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [308] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {48176#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:33,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {48244#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [311] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3399)) (.cse1 (= v_main_~y~0_2737 v_main_~y~0_2736)) (.cse2 (= v_main_~x~0_3399 v_main_~x~0_3398))) (or (and .cse0 (= (+ v_main_~x~0_3399 v_main_~y~0_2736) (+ v_main_~x~0_3398 v_main_~y~0_2737)) (< v_main_~x~0_3399 v_main_~x~0_3398) (< v_main_~x~0_3398 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_3399 1000000)))) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3399, main_~y~0=v_main_~y~0_2737} OutVars{main_~x~0=v_main_~x~0_3398, main_~y~0=v_main_~y~0_2736} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {48240#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:33,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {48244#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [310] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48244#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:33,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {48251#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [309] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3397 v_main_~x~0_3396))) (or (and (< v_main_~x~0_3396 500001) (< v_main_~x~0_3397 v_main_~x~0_3396)) .cse0 (and (not (< v_main_~x~0_3397 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3396} AuxVars[] AssignedVars[main_~x~0] {48244#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:33,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {48168#true} ~x~0 := 0;~y~0 := 500000; {48251#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:33,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {48168#true} call #t~ret4 := main(); {48168#true} is VALID [2022-04-15 07:06:33,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48168#true} {48168#true} #41#return; {48168#true} is VALID [2022-04-15 07:06:33,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {48168#true} assume true; {48168#true} is VALID [2022-04-15 07:06:33,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {48168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48168#true} is VALID [2022-04-15 07:06:33,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {48168#true} call ULTIMATE.init(); {48168#true} is VALID [2022-04-15 07:06:33,430 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 07:06:33,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35687026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:06:33,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:06:33,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:06:36,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:06:36,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233616735] [2022-04-15 07:06:36,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233616735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:36,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:36,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-15 07:06:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241033663] [2022-04-15 07:06:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:06:36,208 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 07:06:36,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:06:36,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:36,332 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 07:06:36,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-15 07:06:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-15 07:06:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=6684, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 07:06:36,333 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:50,779 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2022-04-15 07:06:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 07:06:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 07:06:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:06:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 163 transitions. [2022-04-15 07:06:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 163 transitions. [2022-04-15 07:06:50,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 163 transitions. [2022-04-15 07:06:50,872 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 07:06:50,874 INFO L225 Difference]: With dead ends: 158 [2022-04-15 07:06:50,874 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 07:06:50,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4282 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1383, Invalid=22487, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 07:06:50,875 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 143 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9259 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 9259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:06:50,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 48 Invalid, 9400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 9259 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 07:06:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 07:06:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-04-15 07:06:51,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:06:51,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:51,323 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:51,323 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:51,324 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 07:06:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 07:06:51,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:51,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:51,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-15 07:06:51,325 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-15 07:06:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:06:51,326 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 07:06:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 07:06:51,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:06:51,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:06:51,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:06:51,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:06:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2022-04-15 07:06:51,328 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 147 [2022-04-15 07:06:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:06:51,328 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2022-04-15 07:06:51,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 72 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:51,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 154 transitions. [2022-04-15 07:06:51,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 07:06:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 07:06:51,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:06:51,455 INFO L499 BasicCegarLoop]: trace histogram [69, 67, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:06:51,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-15 07:06:51,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-15 07:06:51,656 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:06:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:06:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash -17714290, now seen corresponding path program 67 times [2022-04-15 07:06:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528840700] [2022-04-15 07:06:55,721 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:06:55,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:55,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:06:55,996 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:06:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1566159441, now seen corresponding path program 1 times [2022-04-15 07:06:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:06:55,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050341497] [2022-04-15 07:06:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:06:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:06:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:56,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {49409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {49398#true} is VALID [2022-04-15 07:06:56,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {49398#true} assume true; {49398#true} is VALID [2022-04-15 07:06:56,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49398#true} {49398#true} #41#return; {49398#true} is VALID [2022-04-15 07:06:56,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {49398#true} call ULTIMATE.init(); {49409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:06:56,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {49409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {49398#true} is VALID [2022-04-15 07:06:56,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {49398#true} assume true; {49398#true} is VALID [2022-04-15 07:06:56,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49398#true} {49398#true} #41#return; {49398#true} is VALID [2022-04-15 07:06:56,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {49398#true} call #t~ret4 := main(); {49398#true} is VALID [2022-04-15 07:06:56,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {49398#true} ~x~0 := 0;~y~0 := 500000; {49403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:56,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {49403#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [313] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3482 v_main_~x~0_3481))) (or (and (< v_main_~x~0_3481 500001) (< v_main_~x~0_3482 v_main_~x~0_3481)) (and (<= 500000 v_main_~x~0_3482) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3481} AuxVars[] AssignedVars[main_~x~0] {49404#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:56,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {49404#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [314] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49404#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:06:56,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {49404#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [315] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3484)) (.cse1 (= v_main_~y~0_2812 v_main_~y~0_2811)) (.cse2 (= v_main_~x~0_3484 v_main_~x~0_3483))) (or (and (or (not .cse0) (not (< v_main_~x~0_3484 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3484 v_main_~y~0_2811))) (and (< v_main_~y~0_2812 v_main_~y~0_2811) (< .cse3 (+ 1000001 v_main_~y~0_2812)) (= .cse3 (+ v_main_~x~0_3483 v_main_~y~0_2812)) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3484, main_~y~0=v_main_~y~0_2812} OutVars{main_~x~0=v_main_~x~0_3483, main_~y~0=v_main_~y~0_2811} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {49405#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:56,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {49405#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [312] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {49406#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:56,081 INFO L272 TraceCheckUtils]: 10: Hoare triple {49406#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {49407#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:06:56,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {49407#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {49408#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:06:56,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {49408#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {49399#false} is VALID [2022-04-15 07:06:56,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {49399#false} assume !false; {49399#false} is VALID [2022-04-15 07:06:56,082 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 07:06:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:06:56,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050341497] [2022-04-15 07:06:56,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050341497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:06:56,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652929368] [2022-04-15 07:06:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:06:56,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:06:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:06:56,083 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:06:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-15 07:06:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:56,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:06:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:06:56,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:06:56,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {49398#true} call ULTIMATE.init(); {49398#true} is VALID [2022-04-15 07:06:56,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {49398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {49398#true} is VALID [2022-04-15 07:06:56,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {49398#true} assume true; {49398#true} is VALID [2022-04-15 07:06:56,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49398#true} {49398#true} #41#return; {49398#true} is VALID [2022-04-15 07:06:56,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {49398#true} call #t~ret4 := main(); {49398#true} is VALID [2022-04-15 07:06:56,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {49398#true} ~x~0 := 0;~y~0 := 500000; {49428#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:06:56,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {49428#(and (<= main_~x~0 0) (= main_~y~0 500000))} [313] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3482 v_main_~x~0_3481))) (or (and (< v_main_~x~0_3481 500001) (< v_main_~x~0_3482 v_main_~x~0_3481)) (and (<= 500000 v_main_~x~0_3482) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3481} AuxVars[] AssignedVars[main_~x~0] {49432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:56,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {49432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [314] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49432#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:06:56,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {49432#(and (= main_~y~0 500000) (< main_~x~0 500001))} [315] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3484)) (.cse1 (= v_main_~y~0_2812 v_main_~y~0_2811)) (.cse2 (= v_main_~x~0_3484 v_main_~x~0_3483))) (or (and (or (not .cse0) (not (< v_main_~x~0_3484 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3484 v_main_~y~0_2811))) (and (< v_main_~y~0_2812 v_main_~y~0_2811) (< .cse3 (+ 1000001 v_main_~y~0_2812)) (= .cse3 (+ v_main_~x~0_3483 v_main_~y~0_2812)) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3484, main_~y~0=v_main_~y~0_2812} OutVars{main_~x~0=v_main_~x~0_3483, main_~y~0=v_main_~y~0_2811} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {49439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:06:56,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {49439#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [312] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {49443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:06:56,499 INFO L272 TraceCheckUtils]: 10: Hoare triple {49443#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {49447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:56,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {49447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:56,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {49451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49399#false} is VALID [2022-04-15 07:06:56,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {49399#false} assume !false; {49399#false} is VALID [2022-04-15 07:06:56,499 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 07:06:56,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:06:56,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {49399#false} assume !false; {49399#false} is VALID [2022-04-15 07:06:56,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {49451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49399#false} is VALID [2022-04-15 07:06:56,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {49447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:06:56,857 INFO L272 TraceCheckUtils]: 10: Hoare triple {49406#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {49447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:06:56,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {49470#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [312] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {49406#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:06:56,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {49474#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [315] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3484)) (.cse1 (= v_main_~y~0_2812 v_main_~y~0_2811)) (.cse2 (= v_main_~x~0_3484 v_main_~x~0_3483))) (or (and (or (not .cse0) (not (< v_main_~x~0_3484 1000000))) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3484 v_main_~y~0_2811))) (and (< v_main_~y~0_2812 v_main_~y~0_2811) (< .cse3 (+ 1000001 v_main_~y~0_2812)) (= .cse3 (+ v_main_~x~0_3483 v_main_~y~0_2812)) .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3484, main_~y~0=v_main_~y~0_2812} OutVars{main_~x~0=v_main_~x~0_3483, main_~y~0=v_main_~y~0_2811} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {49470#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:56,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {49474#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [314] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49474#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:56,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {49481#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [313] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3482 v_main_~x~0_3481))) (or (and (< v_main_~x~0_3481 500001) (< v_main_~x~0_3482 v_main_~x~0_3481)) (and (<= 500000 v_main_~x~0_3482) .cse0) .cse0)) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3481} AuxVars[] AssignedVars[main_~x~0] {49474#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:56,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {49398#true} ~x~0 := 0;~y~0 := 500000; {49481#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:06:56,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {49398#true} call #t~ret4 := main(); {49398#true} is VALID [2022-04-15 07:06:56,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49398#true} {49398#true} #41#return; {49398#true} is VALID [2022-04-15 07:06:56,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {49398#true} assume true; {49398#true} is VALID [2022-04-15 07:06:56,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {49398#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {49398#true} is VALID [2022-04-15 07:06:56,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {49398#true} call ULTIMATE.init(); {49398#true} is VALID [2022-04-15 07:06:56,861 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 07:06:56,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652929368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:06:56,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:06:56,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:06:59,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:06:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528840700] [2022-04-15 07:06:59,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528840700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:06:59,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:06:59,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-15 07:06:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929721920] [2022-04-15 07:06:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:06:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 07:06:59,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:06:59,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:06:59,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:06:59,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-15 07:06:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:06:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-15 07:06:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=6848, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 07:06:59,954 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:14,913 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2022-04-15 07:07:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-04-15 07:07:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 07:07:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2022-04-15 07:07:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2022-04-15 07:07:14,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 165 transitions. [2022-04-15 07:07:15,069 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 07:07:15,070 INFO L225 Difference]: With dead ends: 160 [2022-04-15 07:07:15,070 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 07:07:15,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4378 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1402, Invalid=23090, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 07:07:15,071 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 145 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 10071 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 10071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:15,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 293 Invalid, 10214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 10071 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 07:07:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 07:07:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-15 07:07:15,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:15,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:15,531 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:15,531 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:15,532 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-04-15 07:07:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2022-04-15 07:07:15,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:15,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:15,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 07:07:15,533 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 07:07:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:15,534 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-04-15 07:07:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2022-04-15 07:07:15,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:15,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:15,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:15,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2022-04-15 07:07:15,536 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 149 [2022-04-15 07:07:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:15,536 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2022-04-15 07:07:15,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 73 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:15,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 156 transitions. [2022-04-15 07:07:15,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2022-04-15 07:07:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 07:07:15,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:15,674 INFO L499 BasicCegarLoop]: trace histogram [70, 68, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:15,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-15 07:07:15,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-15 07:07:15,874 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 392869353, now seen corresponding path program 68 times [2022-04-15 07:07:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:15,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528715868] [2022-04-15 07:07:15,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:20,082 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:07:20,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:20,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash 483372719, now seen corresponding path program 1 times [2022-04-15 07:07:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:20,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000420401] [2022-04-15 07:07:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:20,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:20,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {50654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {50643#true} assume true; {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50643#true} {50643#true} #41#return; {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {50643#true} call ULTIMATE.init(); {50654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:20,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {50654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {50643#true} assume true; {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50643#true} {50643#true} #41#return; {50643#true} is VALID [2022-04-15 07:07:20,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {50643#true} call #t~ret4 := main(); {50643#true} is VALID [2022-04-15 07:07:20,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {50643#true} ~x~0 := 0;~y~0 := 500000; {50648#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:07:20,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {50648#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [317] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3568 v_main_~x~0_3567))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_3568)) (and (< v_main_~x~0_3568 v_main_~x~0_3567) (< v_main_~x~0_3567 500001)))) InVars {main_~x~0=v_main_~x~0_3568} OutVars{main_~x~0=v_main_~x~0_3567} AuxVars[] AssignedVars[main_~x~0] {50649#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:07:20,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {50649#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [318] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50649#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:07:20,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {50649#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [319] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3570)) (.cse1 (= v_main_~x~0_3570 v_main_~x~0_3569)) (.cse2 (= v_main_~y~0_2888 v_main_~y~0_2887))) (or (and .cse0 (< v_main_~x~0_3569 1000001) (= (+ v_main_~x~0_3570 v_main_~y~0_2887) (+ v_main_~x~0_3569 v_main_~y~0_2888)) (< v_main_~x~0_3570 v_main_~x~0_3569)) (and (or (not .cse0) (not (< v_main_~x~0_3570 1000000))) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3570, main_~y~0=v_main_~y~0_2888} OutVars{main_~x~0=v_main_~x~0_3569, main_~y~0=v_main_~y~0_2887} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {50650#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:07:20,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {50650#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [316] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {50651#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:07:20,261 INFO L272 TraceCheckUtils]: 10: Hoare triple {50651#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {50652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:07:20,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {50652#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {50653#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:07:20,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {50653#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {50644#false} is VALID [2022-04-15 07:07:20,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {50644#false} assume !false; {50644#false} is VALID [2022-04-15 07:07:20,262 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 07:07:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:20,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000420401] [2022-04-15 07:07:20,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000420401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:07:20,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659396958] [2022-04-15 07:07:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:20,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:07:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:20,276 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:07:20,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-15 07:07:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:07:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:20,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:07:20,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {50643#true} call ULTIMATE.init(); {50643#true} is VALID [2022-04-15 07:07:20,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {50643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50643#true} is VALID [2022-04-15 07:07:20,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {50643#true} assume true; {50643#true} is VALID [2022-04-15 07:07:20,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50643#true} {50643#true} #41#return; {50643#true} is VALID [2022-04-15 07:07:20,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {50643#true} call #t~ret4 := main(); {50643#true} is VALID [2022-04-15 07:07:20,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {50643#true} ~x~0 := 0;~y~0 := 500000; {50673#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:07:20,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {50673#(and (<= main_~x~0 0) (= main_~y~0 500000))} [317] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3568 v_main_~x~0_3567))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_3568)) (and (< v_main_~x~0_3568 v_main_~x~0_3567) (< v_main_~x~0_3567 500001)))) InVars {main_~x~0=v_main_~x~0_3568} OutVars{main_~x~0=v_main_~x~0_3567} AuxVars[] AssignedVars[main_~x~0] {50677#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:07:20,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {50677#(and (= main_~y~0 500000) (< main_~x~0 500001))} [318] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50677#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:07:20,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {50677#(and (= main_~y~0 500000) (< main_~x~0 500001))} [319] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3570)) (.cse1 (= v_main_~x~0_3570 v_main_~x~0_3569)) (.cse2 (= v_main_~y~0_2888 v_main_~y~0_2887))) (or (and .cse0 (< v_main_~x~0_3569 1000001) (= (+ v_main_~x~0_3570 v_main_~y~0_2887) (+ v_main_~x~0_3569 v_main_~y~0_2888)) (< v_main_~x~0_3570 v_main_~x~0_3569)) (and (or (not .cse0) (not (< v_main_~x~0_3570 1000000))) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3570, main_~y~0=v_main_~y~0_2888} OutVars{main_~x~0=v_main_~x~0_3569, main_~y~0=v_main_~y~0_2887} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {50684#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:20,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {50684#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [316] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {50688#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:07:20,685 INFO L272 TraceCheckUtils]: 10: Hoare triple {50688#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {50692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:07:20,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {50692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:07:20,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {50696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50644#false} is VALID [2022-04-15 07:07:20,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {50644#false} assume !false; {50644#false} is VALID [2022-04-15 07:07:20,685 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 07:07:20,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:07:21,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {50644#false} assume !false; {50644#false} is VALID [2022-04-15 07:07:21,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {50696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50644#false} is VALID [2022-04-15 07:07:21,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {50692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:07:21,017 INFO L272 TraceCheckUtils]: 10: Hoare triple {50651#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {50692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:07:21,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {50650#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [316] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {50651#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:07:21,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {50718#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [319] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3570)) (.cse1 (= v_main_~x~0_3570 v_main_~x~0_3569)) (.cse2 (= v_main_~y~0_2888 v_main_~y~0_2887))) (or (and .cse0 (< v_main_~x~0_3569 1000001) (= (+ v_main_~x~0_3570 v_main_~y~0_2887) (+ v_main_~x~0_3569 v_main_~y~0_2888)) (< v_main_~x~0_3570 v_main_~x~0_3569)) (and (or (not .cse0) (not (< v_main_~x~0_3570 1000000))) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_3570, main_~y~0=v_main_~y~0_2888} OutVars{main_~x~0=v_main_~x~0_3569, main_~y~0=v_main_~y~0_2887} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {50650#(or (<= main_~x~0 999999) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:07:21,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {50718#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [318] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50718#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:07:21,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {50725#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [317] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3568 v_main_~x~0_3567))) (or .cse0 (and .cse0 (<= 500000 v_main_~x~0_3568)) (and (< v_main_~x~0_3568 v_main_~x~0_3567) (< v_main_~x~0_3567 500001)))) InVars {main_~x~0=v_main_~x~0_3568} OutVars{main_~x~0=v_main_~x~0_3567} AuxVars[] AssignedVars[main_~x~0] {50718#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:07:21,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {50643#true} ~x~0 := 0;~y~0 := 500000; {50725#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:07:21,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {50643#true} call #t~ret4 := main(); {50643#true} is VALID [2022-04-15 07:07:21,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50643#true} {50643#true} #41#return; {50643#true} is VALID [2022-04-15 07:07:21,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {50643#true} assume true; {50643#true} is VALID [2022-04-15 07:07:21,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {50643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50643#true} is VALID [2022-04-15 07:07:21,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {50643#true} call ULTIMATE.init(); {50643#true} is VALID [2022-04-15 07:07:21,020 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 07:07:21,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659396958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:07:21,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:07:21,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 07:07:24,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:24,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528715868] [2022-04-15 07:07:24,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528715868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:24,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-15 07:07:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061820502] [2022-04-15 07:07:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 07:07:24,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:24,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:24,109 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 07:07:24,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-15 07:07:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-15 07:07:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=6922, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 07:07:24,110 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:40,196 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2022-04-15 07:07:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 07:07:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 07:07:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2022-04-15 07:07:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 167 transitions. [2022-04-15 07:07:40,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 167 transitions. [2022-04-15 07:07:40,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:40,295 INFO L225 Difference]: With dead ends: 162 [2022-04-15 07:07:40,295 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 07:07:40,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1268, Invalid=23538, Unknown=0, NotChecked=0, Total=24806 [2022-04-15 07:07:40,297 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 10227 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 10372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 10227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:40,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 238 Invalid, 10372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 10227 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 07:07:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 07:07:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-04-15 07:07:40,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:40,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,566 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,566 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:40,568 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2022-04-15 07:07:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2022-04-15 07:07:40,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:40,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:40,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-15 07:07:40,568 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-15 07:07:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:40,569 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2022-04-15 07:07:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2022-04-15 07:07:40,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:40,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:40,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:40,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2022-04-15 07:07:40,571 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 151 [2022-04-15 07:07:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:40,571 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2022-04-15 07:07:40,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.96) internal successors, (147), 74 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:40,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 158 transitions. [2022-04-15 07:07:40,670 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 07:07:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2022-04-15 07:07:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 07:07:40,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:40,671 INFO L499 BasicCegarLoop]: trace histogram [71, 69, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-15 07:07:40,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-04-15 07:07:40,883 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -173240956, now seen corresponding path program 69 times [2022-04-15 07:07:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:40,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440510688] [2022-04-15 07:07:44,955 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:07:45,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:45,224 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:45,225 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1762062417, now seen corresponding path program 1 times [2022-04-15 07:07:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892615126] [2022-04-15 07:07:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:45,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {51913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {51902#true} assume true; {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51902#true} {51902#true} #41#return; {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {51902#true} call ULTIMATE.init(); {51913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:45,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {51913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {51902#true} assume true; {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51902#true} {51902#true} #41#return; {51902#true} is VALID [2022-04-15 07:07:45,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {51902#true} call #t~ret4 := main(); {51902#true} is VALID [2022-04-15 07:07:45,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {51902#true} ~x~0 := 0;~y~0 := 500000; {51907#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:07:45,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {51907#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [321] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3655 v_main_~x~0_3654))) (or (and (not (< v_main_~x~0_3655 500000)) .cse0) (and (< v_main_~x~0_3654 500001) (< v_main_~x~0_3655 v_main_~x~0_3654)) .cse0)) InVars {main_~x~0=v_main_~x~0_3655} OutVars{main_~x~0=v_main_~x~0_3654} AuxVars[] AssignedVars[main_~x~0] {51908#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:07:45,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {51908#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [322] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51908#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:07:45,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {51908#(or (= main_~x~0 0) (and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000)))} [323] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_3657)) (.cse0 (= v_main_~y~0_2965 v_main_~y~0_2964)) (.cse1 (= v_main_~x~0_3657 v_main_~x~0_3656))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_3657 1000000)))) (and (< v_main_~x~0_3657 v_main_~x~0_3656) .cse2 (< v_main_~x~0_3656 1000001) (= (+ v_main_~x~0_3656 v_main_~y~0_2965) (+ v_main_~x~0_3657 v_main_~y~0_2964))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3657, main_~y~0=v_main_~y~0_2965} OutVars{main_~x~0=v_main_~x~0_3656, main_~y~0=v_main_~y~0_2964} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {51909#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:45,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {51909#(or (<= main_~x~0 500000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [320] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {51910#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:07:45,300 INFO L272 TraceCheckUtils]: 10: Hoare triple {51910#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {51911#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:07:45,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {51911#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {51912#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:07:45,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {51912#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {51903#false} is VALID [2022-04-15 07:07:45,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {51903#false} assume !false; {51903#false} is VALID [2022-04-15 07:07:45,300 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 07:07:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:45,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892615126] [2022-04-15 07:07:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892615126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:07:45,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435114992] [2022-04-15 07:07:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:07:45,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:45,302 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:07:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-15 07:07:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:45,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:07:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:07:45,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {51902#true} call ULTIMATE.init(); {51902#true} is VALID [2022-04-15 07:07:45,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {51902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {51902#true} is VALID [2022-04-15 07:07:45,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {51902#true} assume true; {51902#true} is VALID [2022-04-15 07:07:45,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51902#true} {51902#true} #41#return; {51902#true} is VALID [2022-04-15 07:07:45,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {51902#true} call #t~ret4 := main(); {51902#true} is VALID [2022-04-15 07:07:45,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {51902#true} ~x~0 := 0;~y~0 := 500000; {51932#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:07:45,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {51932#(and (<= main_~x~0 0) (= main_~y~0 500000))} [321] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3655 v_main_~x~0_3654))) (or (and (not (< v_main_~x~0_3655 500000)) .cse0) (and (< v_main_~x~0_3654 500001) (< v_main_~x~0_3655 v_main_~x~0_3654)) .cse0)) InVars {main_~x~0=v_main_~x~0_3655} OutVars{main_~x~0=v_main_~x~0_3654} AuxVars[] AssignedVars[main_~x~0] {51936#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:07:45,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {51936#(and (= main_~y~0 500000) (< main_~x~0 500001))} [322] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51936#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:07:45,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {51936#(and (= main_~y~0 500000) (< main_~x~0 500001))} [323] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_3657)) (.cse0 (= v_main_~y~0_2965 v_main_~y~0_2964)) (.cse1 (= v_main_~x~0_3657 v_main_~x~0_3656))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_3657 1000000)))) (and (< v_main_~x~0_3657 v_main_~x~0_3656) .cse2 (< v_main_~x~0_3656 1000001) (= (+ v_main_~x~0_3656 v_main_~y~0_2965) (+ v_main_~x~0_3657 v_main_~y~0_2964))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3657, main_~y~0=v_main_~y~0_2965} OutVars{main_~x~0=v_main_~x~0_3656, main_~y~0=v_main_~y~0_2964} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {51943#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:45,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {51943#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [320] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {51947#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:07:45,570 INFO L272 TraceCheckUtils]: 10: Hoare triple {51947#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {51951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:07:45,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {51951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:07:45,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {51955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51903#false} is VALID [2022-04-15 07:07:45,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {51903#false} assume !false; {51903#false} is VALID [2022-04-15 07:07:45,578 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 07:07:45,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:07:45,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {51903#false} assume !false; {51903#false} is VALID [2022-04-15 07:07:45,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {51955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51903#false} is VALID [2022-04-15 07:07:45,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {51951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:07:45,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {51910#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {51951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:07:45,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {51974#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [320] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {51910#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:07:45,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {51978#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [323] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_3657)) (.cse0 (= v_main_~y~0_2965 v_main_~y~0_2964)) (.cse1 (= v_main_~x~0_3657 v_main_~x~0_3656))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_3657 1000000)))) (and (< v_main_~x~0_3657 v_main_~x~0_3656) .cse2 (< v_main_~x~0_3656 1000001) (= (+ v_main_~x~0_3656 v_main_~y~0_2965) (+ v_main_~x~0_3657 v_main_~y~0_2964))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3657, main_~y~0=v_main_~y~0_2965} OutVars{main_~x~0=v_main_~x~0_3656, main_~y~0=v_main_~y~0_2964} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {51974#(or (< main_~x~0 1000000) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:45,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {51978#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} [322] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51978#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:45,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {51985#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} [321] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3655 v_main_~x~0_3654))) (or (and (not (< v_main_~x~0_3655 500000)) .cse0) (and (< v_main_~x~0_3654 500001) (< v_main_~x~0_3655 v_main_~x~0_3654)) .cse0)) InVars {main_~x~0=v_main_~x~0_3655} OutVars{main_~x~0=v_main_~x~0_3654} AuxVars[] AssignedVars[main_~x~0] {51978#(or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:07:45,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {51902#true} ~x~0 := 0;~y~0 := 500000; {51985#(and (<= 500000 main_~y~0) (or (not (<= 500000 main_~x~0)) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))) (or (<= 500000 main_~x~0) (<= main_~y~0 500000)))} is VALID [2022-04-15 07:07:45,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {51902#true} call #t~ret4 := main(); {51902#true} is VALID [2022-04-15 07:07:45,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51902#true} {51902#true} #41#return; {51902#true} is VALID [2022-04-15 07:07:45,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {51902#true} assume true; {51902#true} is VALID [2022-04-15 07:07:45,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {51902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {51902#true} is VALID [2022-04-15 07:07:45,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {51902#true} call ULTIMATE.init(); {51902#true} is VALID [2022-04-15 07:07:45,790 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 07:07:45,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435114992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:07:45,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:07:45,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:07:49,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440510688] [2022-04-15 07:07:49,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440510688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:49,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:49,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-15 07:07:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097865739] [2022-04-15 07:07:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:49,308 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 07:07:49,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:49,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:49,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:49,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-15 07:07:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:49,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-15 07:07:49,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=7182, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 07:07:49,421 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:03,570 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2022-04-15 07:08:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-15 07:08:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 07:08:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 169 transitions. [2022-04-15 07:08:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 169 transitions. [2022-04-15 07:08:03,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 169 transitions. [2022-04-15 07:08:03,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:03,716 INFO L225 Difference]: With dead ends: 164 [2022-04-15 07:08:03,716 INFO L226 Difference]: Without dead ends: 157 [2022-04-15 07:08:03,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4573 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1440, Invalid=24320, Unknown=0, NotChecked=0, Total=25760 [2022-04-15 07:08:03,718 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 149 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10266 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 10413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 10266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:03,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 128 Invalid, 10413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 10266 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 07:08:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-15 07:08:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-15 07:08:04,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:04,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:04,189 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:04,189 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:04,191 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-15 07:08:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-15 07:08:04,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:04,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:04,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-15 07:08:04,191 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-15 07:08:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:04,192 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2022-04-15 07:08:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-15 07:08:04,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:04,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:04,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:04,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2022-04-15 07:08:04,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 153 [2022-04-15 07:08:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:04,194 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2022-04-15 07:08:04,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 75 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:04,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 160 transitions. [2022-04-15 07:08:04,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2022-04-15 07:08:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 07:08:04,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:04,346 INFO L499 BasicCegarLoop]: trace histogram [72, 70, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:04,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-15 07:08:04,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:08:04,547 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1255598687, now seen corresponding path program 70 times [2022-04-15 07:08:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:04,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076164545] [2022-04-15 07:08:08,608 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:08,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:08,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:08,870 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 287469743, now seen corresponding path program 1 times [2022-04-15 07:08:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:08,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676097376] [2022-04-15 07:08:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:08,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {53188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {53177#true} is VALID [2022-04-15 07:08:08,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {53177#true} assume true; {53177#true} is VALID [2022-04-15 07:08:08,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53177#true} {53177#true} #41#return; {53177#true} is VALID [2022-04-15 07:08:08,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {53177#true} call ULTIMATE.init(); {53188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:08,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {53188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {53177#true} is VALID [2022-04-15 07:08:08,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {53177#true} assume true; {53177#true} is VALID [2022-04-15 07:08:08,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53177#true} {53177#true} #41#return; {53177#true} is VALID [2022-04-15 07:08:08,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {53177#true} call #t~ret4 := main(); {53177#true} is VALID [2022-04-15 07:08:08,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {53177#true} ~x~0 := 0;~y~0 := 500000; {53182#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:08:08,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {53182#(and (<= 500000 main_~y~0) (= main_~x~0 0) (<= main_~y~0 500000))} [325] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3743 v_main_~x~0_3742))) (or (and (< v_main_~x~0_3743 v_main_~x~0_3742) (< v_main_~x~0_3742 500001)) .cse0 (and (not (< v_main_~x~0_3743 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3743} OutVars{main_~x~0=v_main_~x~0_3742} AuxVars[] AssignedVars[main_~x~0] {53183#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:08:08,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {53183#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [326] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53183#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} is VALID [2022-04-15 07:08:08,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {53183#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 500000))} [327] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_3043 v_main_~y~0_3042)) (.cse2 (= v_main_~x~0_3745 v_main_~x~0_3744)) (.cse0 (<= 500000 v_main_~x~0_3745))) (or (and (or (not (< v_main_~x~0_3745 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3745 v_main_~y~0_3042))) (and .cse0 (< .cse3 (+ 1000001 v_main_~y~0_3043)) (< v_main_~y~0_3043 v_main_~y~0_3042) (= .cse3 (+ v_main_~x~0_3744 v_main_~y~0_3043)))))) InVars {main_~x~0=v_main_~x~0_3745, main_~y~0=v_main_~y~0_3043} OutVars{main_~x~0=v_main_~x~0_3744, main_~y~0=v_main_~y~0_3042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {53184#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:08:08,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {53184#(or (<= main_~x~0 500000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [324] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {53185#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:08:08,938 INFO L272 TraceCheckUtils]: 10: Hoare triple {53185#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {53186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:08:08,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {53186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {53187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:08:08,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {53187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {53178#false} is VALID [2022-04-15 07:08:08,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {53178#false} assume !false; {53178#false} is VALID [2022-04-15 07:08:08,939 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 07:08:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676097376] [2022-04-15 07:08:08,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676097376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:08:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089507907] [2022-04-15 07:08:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:08,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:08:08,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:08:08,940 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:08:08,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-15 07:08:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:08,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:08:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:08,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:08:09,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {53177#true} call ULTIMATE.init(); {53177#true} is VALID [2022-04-15 07:08:09,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {53177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {53177#true} is VALID [2022-04-15 07:08:09,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {53177#true} assume true; {53177#true} is VALID [2022-04-15 07:08:09,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53177#true} {53177#true} #41#return; {53177#true} is VALID [2022-04-15 07:08:09,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {53177#true} call #t~ret4 := main(); {53177#true} is VALID [2022-04-15 07:08:09,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {53177#true} ~x~0 := 0;~y~0 := 500000; {53207#(and (<= main_~x~0 0) (= main_~y~0 500000))} is VALID [2022-04-15 07:08:09,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {53207#(and (<= main_~x~0 0) (= main_~y~0 500000))} [325] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3743 v_main_~x~0_3742))) (or (and (< v_main_~x~0_3743 v_main_~x~0_3742) (< v_main_~x~0_3742 500001)) .cse0 (and (not (< v_main_~x~0_3743 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3743} OutVars{main_~x~0=v_main_~x~0_3742} AuxVars[] AssignedVars[main_~x~0] {53211#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:08:09,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {53211#(and (= main_~y~0 500000) (< main_~x~0 500001))} [326] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53211#(and (= main_~y~0 500000) (< main_~x~0 500001))} is VALID [2022-04-15 07:08:09,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {53211#(and (= main_~y~0 500000) (< main_~x~0 500001))} [327] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_3043 v_main_~y~0_3042)) (.cse2 (= v_main_~x~0_3745 v_main_~x~0_3744)) (.cse0 (<= 500000 v_main_~x~0_3745))) (or (and (or (not (< v_main_~x~0_3745 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3745 v_main_~y~0_3042))) (and .cse0 (< .cse3 (+ 1000001 v_main_~y~0_3043)) (< v_main_~y~0_3043 v_main_~y~0_3042) (= .cse3 (+ v_main_~x~0_3744 v_main_~y~0_3043)))))) InVars {main_~x~0=v_main_~x~0_3745, main_~y~0=v_main_~y~0_3043} OutVars{main_~x~0=v_main_~x~0_3744, main_~y~0=v_main_~y~0_3042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {53218#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-15 07:08:09,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {53218#(or (and (= main_~y~0 500000) (< main_~x~0 500001)) (and (< main_~x~0 (+ main_~y~0 1)) (< 500000 main_~y~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0)))} [324] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {53222#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:08:09,197 INFO L272 TraceCheckUtils]: 10: Hoare triple {53222#(and (< main_~x~0 (+ main_~y~0 1)) (<= 1000000 main_~x~0) (< main_~x~0 1000001) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {53226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:08:09,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {53226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:08:09,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {53230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53178#false} is VALID [2022-04-15 07:08:09,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {53178#false} assume !false; {53178#false} is VALID [2022-04-15 07:08:09,198 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 07:08:09,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:08:09,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {53178#false} assume !false; {53178#false} is VALID [2022-04-15 07:08:09,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {53230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53178#false} is VALID [2022-04-15 07:08:09,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {53226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:08:09,428 INFO L272 TraceCheckUtils]: 10: Hoare triple {53185#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} call __VERIFIER_assert((if ~y~0 == ~x~0 then 1 else 0)); {53226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:08:09,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {53249#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [324] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_8 1000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {53185#(and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:08:09,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {53253#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [327] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_3043 v_main_~y~0_3042)) (.cse2 (= v_main_~x~0_3745 v_main_~x~0_3744)) (.cse0 (<= 500000 v_main_~x~0_3745))) (or (and (or (not (< v_main_~x~0_3745 1000000)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_3745 v_main_~y~0_3042))) (and .cse0 (< .cse3 (+ 1000001 v_main_~y~0_3043)) (< v_main_~y~0_3043 v_main_~y~0_3042) (= .cse3 (+ v_main_~x~0_3744 v_main_~y~0_3043)))))) InVars {main_~x~0=v_main_~x~0_3745, main_~y~0=v_main_~y~0_3043} OutVars{main_~x~0=v_main_~x~0_3744, main_~y~0=v_main_~y~0_3042} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {53249#(or (< main_~x~0 1000000) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:08:09,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {53253#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} [326] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53253#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:08:09,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {53260#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} [325] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_3743 v_main_~x~0_3742))) (or (and (< v_main_~x~0_3743 v_main_~x~0_3742) (< v_main_~x~0_3742 500001)) .cse0 (and (not (< v_main_~x~0_3743 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_3743} OutVars{main_~x~0=v_main_~x~0_3742} AuxVars[] AssignedVars[main_~x~0] {53253#(or (not (<= 500000 main_~x~0)) (and (<= main_~x~0 main_~y~0) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:08:09,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {53177#true} ~x~0 := 0;~y~0 := 500000; {53260#(and (<= 500000 main_~y~0) (or (<= 500000 main_~x~0) (< main_~y~0 500001)) (<= main_~x~0 main_~y~0) (or (not (<= 500000 main_~x~0)) (< main_~y~0 (+ main_~x~0 1))))} is VALID [2022-04-15 07:08:09,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {53177#true} call #t~ret4 := main(); {53177#true} is VALID [2022-04-15 07:08:09,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53177#true} {53177#true} #41#return; {53177#true} is VALID [2022-04-15 07:08:09,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {53177#true} assume true; {53177#true} is VALID [2022-04-15 07:08:09,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {53177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {53177#true} is VALID [2022-04-15 07:08:09,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {53177#true} call ULTIMATE.init(); {53177#true} is VALID [2022-04-15 07:08:09,432 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 07:08:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089507907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:08:09,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:08:09,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 07:08:12,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:12,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076164545] [2022-04-15 07:08:12,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076164545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:12,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:12,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-04-15 07:08:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252318495] [2022-04-15 07:08:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:12,415 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 07:08:12,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:12,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:12,487 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 07:08:12,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-04-15 07:08:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-04-15 07:08:12,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=7352, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 07:08:12,488 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:28,221 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2022-04-15 07:08:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-15 07:08:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-15 07:08:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2022-04-15 07:08:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2022-04-15 07:08:28,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 171 transitions. [2022-04-15 07:08:28,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:28,371 INFO L225 Difference]: With dead ends: 166 [2022-04-15 07:08:28,371 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 07:08:28,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1459, Invalid=24947, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 07:08:28,372 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 11160 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 11160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:28,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 343 Invalid, 11309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 11160 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 07:08:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 07:08:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-04-15 07:08:28,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:28,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,789 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,789 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:28,791 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2022-04-15 07:08:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2022-04-15 07:08:28,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:28,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:28,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-15 07:08:28,791 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-15 07:08:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:28,792 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2022-04-15 07:08:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2022-04-15 07:08:28,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:28,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:28,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:28,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2022-04-15 07:08:28,794 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 155 [2022-04-15 07:08:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:28,794 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2022-04-15 07:08:28,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 76 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:28,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 162 transitions. [2022-04-15 07:08:28,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2022-04-15 07:08:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 07:08:28,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:28,902 INFO L499 BasicCegarLoop]: trace histogram [73, 71, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]