/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:43:34,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:43:34,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:43:34,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:43:34,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:43:34,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:43:34,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:43:34,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:43:34,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:43:34,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:43:34,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:43:34,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:43:34,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:43:34,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:43:34,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:43:34,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:43:34,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:43:34,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:43:34,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:43:34,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:43:34,341 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:43:34,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:43:34,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:43:34,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:43:34,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:43:34,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:43:34,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:43:34,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:43:34,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:43:34,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:43:34,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:43:34,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:43:34,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:43:34,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:43:34,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:43:34,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:43:34,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:43:34,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:43:34,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:43:34,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:43:34,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:43:34,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:43:34,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:43:34,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:43:34,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:43:34,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:43:34,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:43:34,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:43:34,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:34,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:43:34,377 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:43:34,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:43:34,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:43:34,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:43:34,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:43:34,563 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:43:34,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-28 03:43:34,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca82738c/04346bb6552a46dba514fcbbcaa9478c/FLAG789d1f67b [2022-04-28 03:43:34,976 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:43:34,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-28 03:43:34,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca82738c/04346bb6552a46dba514fcbbcaa9478c/FLAG789d1f67b [2022-04-28 03:43:35,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca82738c/04346bb6552a46dba514fcbbcaa9478c [2022-04-28 03:43:35,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:43:35,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:43:35,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:35,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:43:35,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:43:35,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da1f5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35, skipping insertion in model container [2022-04-28 03:43:35,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:43:35,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:43:35,568 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_13.c[319,332] [2022-04-28 03:43:35,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:35,588 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:43:35,595 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_13.c[319,332] [2022-04-28 03:43:35,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:35,605 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:43:35,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35 WrapperNode [2022-04-28 03:43:35,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:35,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:43:35,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:43:35,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:43:35,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:43:35,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:43:35,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:43:35,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:43:35,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (1/1) ... [2022-04-28 03:43:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:35,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:43:35,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:43:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:43:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:43:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:43:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:43:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:43:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:43:35,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:43:35,830 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:43:35,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:43:35,974 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:43:35,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:43:35,978 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:43:35,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:35 BoogieIcfgContainer [2022-04-28 03:43:35,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:43:35,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:43:35,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:43:35,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:43:35,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:43:35" (1/3) ... [2022-04-28 03:43:35,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aaab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:35, skipping insertion in model container [2022-04-28 03:43:35,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:35" (2/3) ... [2022-04-28 03:43:35,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aaab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:35, skipping insertion in model container [2022-04-28 03:43:35,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:35" (3/3) ... [2022-04-28 03:43:35,985 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_13.c [2022-04-28 03:43:35,993 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:43:35,993 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:43:36,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:43:36,067 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c046eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2522208f [2022-04-28 03:43:36,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:43:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:43:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:43:36,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:36,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:36,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-28 03:43:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637687701] [2022-04-28 03:43:36,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-28 03:43:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:36,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874280853] [2022-04-28 03:43:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:43:36,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:43:36,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:43:36,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:36,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:43:36,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:43:36,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:43:36,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-28 03:43:36,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-28 03:43:36,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:43:36,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-28 03:43:36,238 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {25#false} is VALID [2022-04-28 03:43:36,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:43:36,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:43:36,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:43:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:36,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:36,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874280853] [2022-04-28 03:43:36,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874280853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:36,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637687701] [2022-04-28 03:43:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637687701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17927334] [2022-04-28 03:43:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:36,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:43:36,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:36,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:43:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:43:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:36,295 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,355 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-28 03:43:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:43:36,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:43:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:43:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:43:36,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 03:43:36,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,405 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:43:36,405 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:43:36,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:36,409 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:36,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:43:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:43:36,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:36,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,428 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,429 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,430 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:43:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:43:36,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:36,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:36,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:43:36,431 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:43:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,433 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:43:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:43:36,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:36,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:36,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:36,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-28 03:43:36,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-28 03:43:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-28 03:43:36,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-28 03:43:36,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:43:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:43:36,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:36,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:36,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:43:36,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-28 03:43:36,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099948208] [2022-04-28 03:43:36,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-28 03:43:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:36,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146069985] [2022-04-28 03:43:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:43:36,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:43:36,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:43:36,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:36,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:43:36,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:43:36,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:43:36,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret7 := main(); {156#true} is VALID [2022-04-28 03:43:36,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-28 03:43:36,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-28 03:43:36,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > ~z~0); {157#false} is VALID [2022-04-28 03:43:36,554 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {157#false} is VALID [2022-04-28 03:43:36,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-28 03:43:36,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-28 03:43:36,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 03:43:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:36,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146069985] [2022-04-28 03:43:36,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146069985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:43:36,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:36,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099948208] [2022-04-28 03:43:36,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099948208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:43:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609689912] [2022-04-28 03:43:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:43:36,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:36,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:43:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:43:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:43:36,573 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,635 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-28 03:43:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:43:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:43:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:43:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:43:36,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 03:43:36,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,665 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:43:36,665 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:43:36,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:43:36,668 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:36,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:43:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:43:36,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:36,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,675 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,676 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,678 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:43:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:43:36,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:36,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:36,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:43:36,679 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:43:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:36,681 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:43:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:43:36,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:36,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:36,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:36,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 03:43:36,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-28 03:43:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:36,684 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 03:43:36,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:36,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 03:43:36,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:43:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:43:36,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:36,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:36,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:43:36,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:36,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-28 03:43:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726853887] [2022-04-28 03:43:36,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:36,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-28 03:43:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:36,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536646383] [2022-04-28 03:43:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:36,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:43:36,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:43:36,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:43:36,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:36,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:43:36,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:43:36,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:43:36,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret7 := main(); {279#true} is VALID [2022-04-28 03:43:36,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:36,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [58] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_14 v_main_~x~0_13)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~x~0_14 v_main_~x~0_13) (< v_main_~x~0_13 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_14 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_14, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_13, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:36,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [57] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:36,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !(~y~0 > ~z~0); {280#false} is VALID [2022-04-28 03:43:36,963 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {280#false} is VALID [2022-04-28 03:43:36,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-28 03:43:36,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-28 03:43:36,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-28 03:43:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:36,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536646383] [2022-04-28 03:43:36,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536646383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:43:37,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:37,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726853887] [2022-04-28 03:43:37,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726853887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:37,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:37,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:43:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664353097] [2022-04-28 03:43:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:43:37,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:37,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:37,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:43:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:43:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:43:37,018 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:37,113 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 03:43:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:43:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:43:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:43:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:43:37,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-28 03:43:37,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:37,152 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:43:37,152 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:43:37,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:43:37,153 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:37,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:43:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:43:37,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:37,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,163 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,163 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:37,164 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:43:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:43:37,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:37,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:37,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:43:37,165 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:43:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:37,166 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:43:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:43:37,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:37,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:37,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:37,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 03:43:37,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-28 03:43:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:37,168 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 03:43:37,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:37,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 03:43:37,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:43:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:43:37,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:37,187 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:37,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:43:37,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-28 03:43:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:37,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337728450] [2022-04-28 03:43:39,273 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:39,341 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:39,644 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-28 03:43:39,645 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-28 03:43:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814836561] [2022-04-28 03:43:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:39,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:43:39,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:43:39,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:43:39,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:39,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:43:39,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:43:39,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:43:39,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:43:39,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:39,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:39,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:39,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {435#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 2 main_~y~0)))} is VALID [2022-04-28 03:43:39,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 2 main_~y~0)))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {436#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:43:39,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {437#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:43:39,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:43:39,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-28 03:43:39,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:43:39,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:43:39,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:43:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:39,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814836561] [2022-04-28 03:43:39,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814836561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:39,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862008534] [2022-04-28 03:43:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:39,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:39,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:39,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:39,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:43:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:39,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:43:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:39,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:02,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:45:02,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:45:02,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:45:02,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:45:02,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:45:02,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:02,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:02,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:02,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:02,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:02,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {473#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:02,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:45:02,927 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-28 03:45:02,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:45:02,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:45:02,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:45:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:02,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:50,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:45:50,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:45:50,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:45:50,052 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-28 03:45:50,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:45:50,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {501#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:50,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:50,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:50,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:50,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:50,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:50,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:45:50,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:45:50,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:45:50,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:45:50,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:45:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:50,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862008534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:50,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:50,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-04-28 03:45:50,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337728450] [2022-04-28 03:45:50,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337728450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:50,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:50,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:45:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265293725] [2022-04-28 03:45:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:45:50,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:50,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:50,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:45:50,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:45:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:45:50,245 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:50,500 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 03:45:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:45:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:45:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 03:45:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 03:45:50,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-28 03:45:50,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:50,535 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:45:50,535 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:45:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:45:50,536 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:50,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:45:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:45:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:45:50,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:50,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,573 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,573 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:50,574 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:45:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 03:45:50,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:50,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:50,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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-28 03:45:50,575 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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-28 03:45:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:50,576 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:45:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 03:45:50,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:50,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:50,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:50,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 03:45:50,578 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-28 03:45:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:50,578 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 03:45:50,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 03:45:50,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 03:45:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:45:50,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:50,611 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:50,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:45:50,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:50,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash -510493847, now seen corresponding path program 2 times [2022-04-28 03:45:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:50,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191493742] [2022-04-28 03:45:53,174 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:45:53,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:53,568 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-28 03:45:53,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 886374433, now seen corresponding path program 1 times [2022-04-28 03:45:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:53,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044999097] [2022-04-28 03:45:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:53,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-28 03:45:53,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-28 03:45:53,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-28 03:45:53,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:53,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-28 03:45:53,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-28 03:45:53,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-28 03:45:53,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-28 03:45:53,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {745#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:53,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:53,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:53,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {747#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:45:53,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {748#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:45:53,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {749#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:45:53,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {749#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {750#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:45:53,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-28 03:45:53,696 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-28 03:45:53,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-28 03:45:53,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-28 03:45:53,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-28 03:45:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:53,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044999097] [2022-04-28 03:45:53,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044999097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112912838] [2022-04-28 03:45:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:53,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:53,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:45:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:53,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:45:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:53,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:52,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2022-04-28 03:46:52,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-28 03:46:52,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-28 03:46:52,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-28 03:46:52,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-28 03:46:52,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:52,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:52,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:52,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:52,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:52,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {786#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:52,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {790#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:46:52,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-28 03:46:52,049 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-28 03:46:52,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-28 03:46:52,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-28 03:46:52,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-28 03:46:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:52,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:25,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-28 03:47:25,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-28 03:47:25,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-28 03:47:25,696 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-28 03:47:25,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {818#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-28 03:47:25,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {818#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:25,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {822#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:47:25,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:25,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:25,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:25,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:25,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:25,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-28 03:47:25,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-28 03:47:25,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-28 03:47:25,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-28 03:47:25,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2022-04-28 03:47:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:25,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112912838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:25,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:25,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-28 03:47:25,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191493742] [2022-04-28 03:47:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191493742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:25,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:25,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:47:25,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892926921] [2022-04-28 03:47:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:47:25,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:25,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:25,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:47:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:47:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:47:25,858 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:26,136 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 03:47:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:47:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:47:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 03:47:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 03:47:26,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 03:47:26,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:26,175 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:47:26,175 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:47:26,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:47:26,177 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:26,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:47:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:47:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:47:26,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:26,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,197 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,197 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:26,198 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:47:26,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:47:26,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:26,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:26,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states 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-28 03:47:26,203 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states 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-28 03:47:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:26,207 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:47:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:47:26,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:26,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:26,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:26,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 03:47:26,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2022-04-28 03:47:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 03:47:26,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:26,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 03:47:26,234 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-28 03:47:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:47:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:47:26,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:26,236 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:26,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:47:26,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:26,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1246825262, now seen corresponding path program 3 times [2022-04-28 03:47:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622938506] [2022-04-28 03:47:26,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:26,745 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-28 03:47:26,746 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1243873057, now seen corresponding path program 1 times [2022-04-28 03:47:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777540431] [2022-04-28 03:47:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-28 03:47:26,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-28 03:47:26,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-28 03:47:26,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:26,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-28 03:47:26,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-28 03:47:26,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-28 03:47:26,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-28 03:47:26,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1079#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1081#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 3 main_~y~0)))} is VALID [2022-04-28 03:47:26,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 3 main_~y~0)))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1082#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:47:26,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1083#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:47:26,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1084#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:47:26,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-28 03:47:26,951 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-28 03:47:26,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-28 03:47:26,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-28 03:47:26,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-28 03:47:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:26,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777540431] [2022-04-28 03:47:26,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777540431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:26,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344606755] [2022-04-28 03:47:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:26,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:47:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:47:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:15,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2022-04-28 03:48:15,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-28 03:48:15,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-28 03:48:15,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-28 03:48:15,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-28 03:48:15,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:15,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:15,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:15,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:15,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:15,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1120#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:48:15,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {1120#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1124#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:48:15,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {1124#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-28 03:48:15,922 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-28 03:48:15,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-28 03:48:15,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-28 03:48:15,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-28 03:48:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:15,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:30,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-28 03:49:30,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-28 03:49:30,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-28 03:49:30,111 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-28 03:49:30,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-28 03:49:30,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {1156#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1152#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:49:30,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1156#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:49:30,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-28 03:49:30,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-28 03:49:30,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-28 03:49:30,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-28 03:49:30,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2022-04-28 03:49:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344606755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:30,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:30,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-28 03:49:30,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:30,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622938506] [2022-04-28 03:49:30,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622938506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:30,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:30,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:49:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189846877] [2022-04-28 03:49:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:49:30,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:30,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:30,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:49:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:49:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:49:30,321 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:30,703 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-28 03:49:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:49:30,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:49:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-28 03:49:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-28 03:49:30,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-04-28 03:49:30,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:30,740 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:49:30,740 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:49:30,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:49:30,741 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:30,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:49:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:49:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:49:30,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:30,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,776 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,776 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:30,777 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:49:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 03:49:30,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:30,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:30,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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 32 states. [2022-04-28 03:49:30,778 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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 32 states. [2022-04-28 03:49:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:30,779 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:49:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 03:49:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:30,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:30,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:30,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 03:49:30,780 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-28 03:49:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:30,780 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 03:49:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:30,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 03:49:30,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 03:49:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:49:30,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:30,811 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:30,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:31,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:31,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 969620496, now seen corresponding path program 4 times [2022-04-28 03:49:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:31,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132652014] [2022-04-28 03:49:35,081 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:35,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:49:35,461 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-28 03:49:35,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1861547678, now seen corresponding path program 1 times [2022-04-28 03:49:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:35,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698165143] [2022-04-28 03:49:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:35,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-28 03:49:35,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-28 03:49:35,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-28 03:49:35,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:35,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-28 03:49:35,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-28 03:49:35,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-28 03:49:35,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-28 03:49:35,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:35,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:35,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:35,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:35,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:35,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1441#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:49:35,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1441#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1442#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:35,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1442#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1443#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:49:35,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1443#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-28 03:49:35,570 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-28 03:49:35,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-28 03:49:35,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-28 03:49:35,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-28 03:49:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698165143] [2022-04-28 03:49:35,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698165143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898376734] [2022-04-28 03:49:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:35,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:49:35,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:49:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:35,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:49:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:35,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:40,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1435#true} is VALID [2022-04-28 03:50:40,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-28 03:50:40,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-28 03:50:40,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-28 03:50:40,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-28 03:50:40,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:40,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:40,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:40,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:40,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:40,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1479#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:50:40,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1483#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:50:40,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {1483#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1487#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:50:40,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1487#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-28 03:50:40,270 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-28 03:50:40,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-28 03:50:40,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-28 03:50:40,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-28 03:50:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:40,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:46,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-28 03:51:46,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-28 03:51:46,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-28 03:51:46,026 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-28 03:51:46,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {1515#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-28 03:51:46,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1515#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:46,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {1523#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1519#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:51:46,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1523#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:51:46,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:46,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:46,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:46,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:46,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:46,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-28 03:51:46,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-28 03:51:46,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-28 03:51:46,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-28 03:51:46,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1435#true} is VALID [2022-04-28 03:51:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:46,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898376734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:46,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:46,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-28 03:51:46,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132652014] [2022-04-28 03:51:46,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132652014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:51:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581398748] [2022-04-28 03:51:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:46,272 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:51:46,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:46,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:46,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:51:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:51:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=271, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:51:46,293 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,806 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 03:51:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:51:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:51:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-28 03:51:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-28 03:51:46,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-28 03:51:46,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:46,855 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:51:46,855 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:51:46,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=659, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:51:46,856 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:46,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:51:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:51:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-04-28 03:51:46,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:46,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,905 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,905 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,906 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 03:51:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 03:51:46,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:46,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:46,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:51:46,907 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:51:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,908 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 03:51:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 03:51:46,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:46,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:46,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:46,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-28 03:51:46,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-28 03:51:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:46,910 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-28 03:51:46,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-28 03:51:46,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:51:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:51:46,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:46,944 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:46,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:47,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:47,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash -777622499, now seen corresponding path program 5 times [2022-04-28 03:51:47,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:47,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676644810] [2022-04-28 03:51:51,225 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:51,275 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:51,515 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-28 03:51:51,516 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1879071423, now seen corresponding path program 1 times [2022-04-28 03:51:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:51,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624886562] [2022-04-28 03:51:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:51,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:51,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-28 03:51:51,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-28 03:51:51,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1860#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:51,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {1860#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:51,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:51,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1862#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:51:51,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1862#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1863#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:51:51,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {1863#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1864#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:51,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {1864#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1865#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:51:51,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {1865#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1866#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:51,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1867#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:51:51,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {1867#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-28 03:51:51,664 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-28 03:51:51,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-28 03:51:51,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-28 03:51:51,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-28 03:51:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624886562] [2022-04-28 03:51:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624886562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551398014] [2022-04-28 03:51:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:51,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:51,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:51:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:51:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:58,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-28 03:52:58,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-28 03:52:58,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 03:52:58,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-28 03:52:58,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-28 03:52:58,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:58,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:58,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:58,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:58,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:58,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1903#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:52:58,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1907#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:52:58,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1911#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:52:58,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1915#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:52:58,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1915#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-28 03:52:58,609 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-28 03:52:58,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-28 03:52:58,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-28 03:52:58,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-28 03:52:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:58,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:02,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-28 03:54:02,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-28 03:54:02,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-28 03:54:02,008 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-28 03:54:02,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-28 03:54:02,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {1947#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1943#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:54:02,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1947#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:54:02,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {1955#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1951#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:54:02,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1955#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:54:02,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:02,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:02,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:02,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:02,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:02,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-28 03:54:02,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-28 03:54:02,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-28 03:54:02,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-28 03:54:02,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-28 03:54:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:54:02,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551398014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:02,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:02,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-04-28 03:54:02,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676644810] [2022-04-28 03:54:02,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676644810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:02,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:02,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:54:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55873491] [2022-04-28 03:54:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:54:02,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:02,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:02,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:54:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:54:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=536, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:54:02,352 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:03,183 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-04-28 03:54:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:54:03,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:54:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:54:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:54:03,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-28 03:54:03,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:03,227 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:54:03,227 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:54:03,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=644, Invalid=1248, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:54:03,228 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:03,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 70 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:54:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:54:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 03:54:03,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:03,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,329 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,329 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:03,330 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 03:54:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 03:54:03,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:03,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:03,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 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 50 states. [2022-04-28 03:54:03,331 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 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 50 states. [2022-04-28 03:54:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:03,332 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 03:54:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 03:54:03,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:03,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:03,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:03,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 03:54:03,333 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-28 03:54:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:03,333 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 03:54:03,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:03,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 03:54:03,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 03:54:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:54:03,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:03,384 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:03,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:54:03,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:03,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -522473983, now seen corresponding path program 6 times [2022-04-28 03:54:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:03,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838200227] [2022-04-28 03:54:03,701 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:03,977 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-28 03:54:03,978 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash 636479298, now seen corresponding path program 1 times [2022-04-28 03:54:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:03,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282421009] [2022-04-28 03:54:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-28 03:54:04,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-28 03:54:04,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-28 03:54:04,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:04,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-28 03:54:04,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-28 03:54:04,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-28 03:54:04,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-28 03:54:04,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2384#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:04,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {2384#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:54:04,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:54:04,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2386#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:54:04,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {2386#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2387#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:54:04,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {2387#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2388#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:54:04,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {2388#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2389#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:54:04,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {2389#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2390#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:54:04,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2391#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:54:04,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {2391#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2392#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:54:04,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {2392#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-28 03:54:04,204 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-28 03:54:04,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-28 03:54:04,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-28 03:54:04,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-28 03:54:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:04,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282421009] [2022-04-28 03:54:04,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282421009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:04,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985010933] [2022-04-28 03:54:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:04,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:04,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:04,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:04,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:54:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:54:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:04,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:56,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-28 03:54:56,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-28 03:54:56,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-28 03:54:56,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-28 03:54:56,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-28 03:54:56,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:56,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:56,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:56,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:56,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:56,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2428#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:54:56,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {2428#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2432#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:54:56,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2436#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:54:56,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {2436#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2440#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:54:56,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {2440#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2444#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:54:56,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {2444#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-28 03:54:56,830 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-28 03:54:56,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-28 03:54:56,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-28 03:54:56,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-28 03:54:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:54:56,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:22,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-28 03:55:22,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-28 03:55:22,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-28 03:55:22,306 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-28 03:55:22,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-28 03:55:22,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2472#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:55:22,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2480#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2476#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:55:22,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2484#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2480#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:55:22,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2484#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:55:22,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2488#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:55:22,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:55:22,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:55:22,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:55:22,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:55:22,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:55:22,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-28 03:55:22,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-28 03:55:22,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-28 03:55:22,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-28 03:55:22,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-28 03:55:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:22,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985010933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:22,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:22,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2022-04-28 03:55:22,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:22,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838200227] [2022-04-28 03:55:22,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838200227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:22,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:22,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:55:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526035339] [2022-04-28 03:55:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:22,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:22,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:22,695 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-28 03:55:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:55:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:55:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:55:22,696 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,705 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-04-28 03:55:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:55:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-28 03:55:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-28 03:55:23,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-28 03:55:23,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:23,751 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:55:23,751 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 03:55:23,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:55:23,753 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:23,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:55:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 03:55:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 03:55:23,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:23,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-28 03:55:23,883 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-28 03:55:23,883 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-28 03:55:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,885 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 03:55:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:55:23,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 52 states. [2022-04-28 03:55:23,885 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 52 states. [2022-04-28 03:55:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,886 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 03:55:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:55:23,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:23,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-28 03:55:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 03:55:23,888 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 35 [2022-04-28 03:55:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:23,888 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 03:55:23,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 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-28 03:55:23,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 03:55:23,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:55:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:55:23,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:23,938 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:23,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:55:24,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:24,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -802576804, now seen corresponding path program 7 times [2022-04-28 03:55:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:24,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1673490178] [2022-04-28 03:55:24,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:24,444 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-28 03:55:24,445 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash -640907198, now seen corresponding path program 1 times [2022-04-28 03:55:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435595338] [2022-04-28 03:55:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:24,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-28 03:55:24,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-28 03:55:24,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-28 03:55:24,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:24,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-28 03:55:24,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-28 03:55:24,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-28 03:55:24,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-28 03:55:24,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:24,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:24,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:24,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:24,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:24,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2925#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:55:24,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2926#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:55:24,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2926#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2927#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:55:24,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2928#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:55:24,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {2928#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2929#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:55:24,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2929#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-28 03:55:24,573 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-28 03:55:24,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-28 03:55:24,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-28 03:55:24,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-28 03:55:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435595338] [2022-04-28 03:55:24,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435595338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410899515] [2022-04-28 03:55:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:24,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:55:24,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:55:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:24,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:55:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:24,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:30,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2919#true} is VALID [2022-04-28 03:56:30,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-28 03:56:30,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-28 03:56:30,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-28 03:56:30,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-28 03:56:30,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:56:30,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:56:30,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:56:30,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:56:30,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:56:30,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2965#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:56:30,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2969#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:56:30,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {2969#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2973#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:56:30,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2977#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:56:30,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2981#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:56:30,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {2981#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-28 03:56:30,383 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-28 03:56:30,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-28 03:56:30,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-28 03:56:30,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-28 03:56:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:30,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:37,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-28 03:57:37,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-28 03:57:37,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-28 03:57:37,342 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-28 03:57:37,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {3009#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-28 03:57:37,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {3013#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3009#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:57:37,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {3017#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3013#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:57:37,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {3021#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3017#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:57:37,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {3025#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:57:37,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3025#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:57:37,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:57:37,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:57:37,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:57:37,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:57:37,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:57:37,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-28 03:57:37,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-28 03:57:37,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-28 03:57:37,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-28 03:57:37,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2919#true} is VALID [2022-04-28 03:57:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:57:37,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410899515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:37,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:37,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-28 03:57:37,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:37,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1673490178] [2022-04-28 03:57:37,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1673490178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:37,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:37,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:57:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496332110] [2022-04-28 03:57:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:57:37,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:37,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:37,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:37,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:57:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:57:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=585, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:57:37,733 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,755 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-28 03:57:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:57:38,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:57:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2022-04-28 03:57:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2022-04-28 03:57:38,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 63 transitions. [2022-04-28 03:57:38,818 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-28 03:57:38,819 INFO L225 Difference]: With dead ends: 87 [2022-04-28 03:57:38,819 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:57:38,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=846, Invalid=1506, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:57:38,820 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:38,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:57:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:57:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-28 03:57:38,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:38,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,919 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,919 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,920 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-28 03:57:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-28 03:57:38,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:38,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:38,921 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 61 states. [2022-04-28 03:57:38,921 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 61 states. [2022-04-28 03:57:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,922 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-28 03:57:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-28 03:57:38,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:38,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:38,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:38,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-28 03:57:38,923 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 37 [2022-04-28 03:57:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:38,924 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-28 03:57:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-28 03:57:38,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:57:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:57:38,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:38,982 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:39,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:57:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:39,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568111, now seen corresponding path program 8 times [2022-04-28 03:57:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7486446] [2022-04-28 03:57:39,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:39,508 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-28 03:57:39,509 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:39,515 INFO L85 PathProgramCache]: Analyzing trace with hash 697975393, now seen corresponding path program 1 times [2022-04-28 03:57:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:39,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358465716] [2022-04-28 03:57:39,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:39,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-28 03:57:39,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-28 03:57:39,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-28 03:57:39,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {3489#true} call ULTIMATE.init(); {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:39,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-28 03:57:39,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-28 03:57:39,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-28 03:57:39,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {3489#true} call #t~ret7 := main(); {3489#true} is VALID [2022-04-28 03:57:39,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {3489#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3494#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:39,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and (< v_main_~x~0_199 50001) (< v_main_~x~0_200 v_main_~x~0_199)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_200 50000))))) InVars {main_~x~0=v_main_~x~0_200, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_199, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:57:39,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [89] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:57:39,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [90] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_202)) (.cse2 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse3 (= v_main_~y~0_153 v_main_~y~0_152))) (or (let ((.cse0 (div (+ v_main_~x~0_202 (* v_main_~x~0_201 (- 1))) (- 2)))) (and (< 0 .cse0) (= v_main_~y~0_152 (+ v_main_~y~0_153 (* 2 .cse0))) (= (mod (+ v_main_~x~0_202 v_main_~x~0_201) 2) 0) .cse1 (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_202 (- 1))) 2) 2)))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_202 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_153} OutVars{main_~x~0=v_main_~x~0_201, main_~y~0=v_main_~y~0_152} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3496#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:57:39,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {3496#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3497#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:57:39,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {3497#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3498#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:57:39,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3498#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3499#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:57:39,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3499#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3500#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:57:39,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3500#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3501#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:57:39,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3501#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3502#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:57:39,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {3502#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3503#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:57:39,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3503#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !(~y~0 > ~z~0); {3490#false} is VALID [2022-04-28 03:57:39,707 INFO L272 TraceCheckUtils]: 17: Hoare triple {3490#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3490#false} is VALID [2022-04-28 03:57:39,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3490#false} ~cond := #in~cond; {3490#false} is VALID [2022-04-28 03:57:39,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {3490#false} assume 0 == ~cond; {3490#false} is VALID [2022-04-28 03:57:39,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3490#false} assume !false; {3490#false} is VALID [2022-04-28 03:57:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:39,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:39,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358465716] [2022-04-28 03:57:39,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358465716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:39,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190862875] [2022-04-28 03:57:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:39,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:39,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:57:39,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:57:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:39,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:57:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:39,765 INFO L286 TraceCheckSpWp]: Computing forward predicates...