/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/nla-digbench-scaling/bresenham-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:40:53,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:40:53,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:40:53,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:40:53,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:40:53,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:40:53,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:40:53,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:40:53,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:40:53,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:40:53,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:40:53,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:40:53,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:40:53,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:40:53,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:40:53,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:40:53,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:40:53,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:40:53,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:40:53,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:40:53,414 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:40:53,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:40:53,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:40:53,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:40:53,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:40:53,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:40:53,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:40:53,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:40:53,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:40:53,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:40:53,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:40:53,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:40:53,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:40:53,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:40:53,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:40:53,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:40:53,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:40:53,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:40:53,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:40:53,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:40:53,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:40:53,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:40:53,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:40:53,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:40:53,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:40:53,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:40:53,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:40:53,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:40:53,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:40:53,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:40:53,439 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:40:53,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:40:53,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:40:53,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:40:53,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:40:53,651 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:40:53,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound50.c [2022-04-15 07:40:53,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0caeb197/7298f334ee5640eb983abcb42f119ed8/FLAGa4a9601f2 [2022-04-15 07:40:53,991 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:40:53,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound50.c [2022-04-15 07:40:54,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0caeb197/7298f334ee5640eb983abcb42f119ed8/FLAGa4a9601f2 [2022-04-15 07:40:54,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0caeb197/7298f334ee5640eb983abcb42f119ed8 [2022-04-15 07:40:54,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:40:54,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:40:54,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:40:54,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:40:54,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:40:54,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c49a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54, skipping insertion in model container [2022-04-15 07:40:54,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:40:54,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:40:54,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound50.c[597,610] [2022-04-15 07:40:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:40:54,614 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:40:54,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound50.c[597,610] [2022-04-15 07:40:54,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:40:54,634 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:40:54,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54 WrapperNode [2022-04-15 07:40:54,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:40:54,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:40:54,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:40:54,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:40:54,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:40:54,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:40:54,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:40:54,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:40:54,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (1/1) ... [2022-04-15 07:40:54,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:40:54,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:54,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:40:54,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:40:54,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:40:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:40:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:40:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:40:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:40:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:40:54,832 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:40:54,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:40:54,979 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:40:54,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:40:54,985 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:40:54,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:40:54 BoogieIcfgContainer [2022-04-15 07:40:54,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:40:55,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:40:55,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:40:55,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:40:55,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:40:54" (1/3) ... [2022-04-15 07:40:55,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229c2954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:40:55, skipping insertion in model container [2022-04-15 07:40:55,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:40:54" (2/3) ... [2022-04-15 07:40:55,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229c2954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:40:55, skipping insertion in model container [2022-04-15 07:40:55,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:40:54" (3/3) ... [2022-04-15 07:40:55,006 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound50.c [2022-04-15 07:40:55,009 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:40:55,009 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:40:55,047 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:40:55,051 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:40:55,052 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:40:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:40:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:40:55,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:55,067 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:55,068 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-15 07:40:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:55,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182760149] [2022-04-15 07:40:55,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:40:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-15 07:40:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:55,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26395292] [2022-04-15 07:40:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:40:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:55,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:40:55,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:40:55,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:40:55,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:40:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:55,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:40:55,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:40:55,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:40:55,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:40:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 07:40:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:55,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:40:55,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:40:55,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:40:55,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:40:55,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:40:55,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:40:55,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:40:55,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:40:55,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-15 07:40:55,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 07:40:55,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-15 07:40:55,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:40:55,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:40:55,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:40:55,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:40:55,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-15 07:40:55,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-15 07:40:55,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:40:55,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:40:55,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:40:55,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:40:55,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-15 07:40:55,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-15 07:40:55,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-15 07:40:55,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 07:40:55,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 07:40:55,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 07:40:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:40:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:40:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26395292] [2022-04-15 07:40:55,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26395292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:55,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:55,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:40:55,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:40:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182760149] [2022-04-15 07:40:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182760149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:40:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930465479] [2022-04-15 07:40:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:40:55,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:40:55,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:40:55,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:40:55,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:55,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:40:55,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:40:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:40:55,368 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:40:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:55,488 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-15 07:40:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:40:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:40:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:40:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:40:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:40:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:40:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:40:55,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-15 07:40:55,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:55,581 INFO L225 Difference]: With dead ends: 57 [2022-04-15 07:40:55,581 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:40:55,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:40:55,586 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:40:55,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:40:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:40:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 07:40:55,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:40:55,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:40:55,608 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:40:55,608 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:40:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:55,611 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:40:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:40:55,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:55,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:55,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 07:40:55,612 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 07:40:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:55,614 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:40:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:40:55,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:55,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:55,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:40:55,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:40:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:40:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 07:40:55,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 07:40:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:40:55,617 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 07:40:55,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:40:55,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 07:40:55,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:40:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:40:55,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:55,650 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:55,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:40:55,650 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-15 07:40:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394685151] [2022-04-15 07:40:55,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:40:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-15 07:40:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:55,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975314617] [2022-04-15 07:40:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:55,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:40:55,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8801627] [2022-04-15 07:40:55,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:40:55,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:55,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:40:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:40:55,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:40:55,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:40:55,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:40:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:40:55,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-15 07:40:55,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-15 07:40:55,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:40:55,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-15 07:40:55,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-15 07:40:55,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-15 07:40:55,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {273#true} is VALID [2022-04-15 07:40:55,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:40:55,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:40:55,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:40:55,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-15 07:40:55,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-15 07:40:55,947 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {273#true} is VALID [2022-04-15 07:40:55,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:40:55,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:40:55,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:40:55,948 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-15 07:40:55,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:55,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-15 07:40:55,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:55,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:55,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-15 07:40:55,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 07:40:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:40:55,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:40:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:40:55,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975314617] [2022-04-15 07:40:55,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:40:55,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8801627] [2022-04-15 07:40:55,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8801627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:55,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:55,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:40:55,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:40:55,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394685151] [2022-04-15 07:40:55,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394685151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:55,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:55,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:40:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657972038] [2022-04-15 07:40:55,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:40:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:40:55,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:40:55,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:40:55,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:55,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:40:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:40:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:40:55,974 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:40:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:56,154 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 07:40:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:40:56,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:40:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:40:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:40:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:40:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:40:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:40:56,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 07:40:56,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:56,193 INFO L225 Difference]: With dead ends: 39 [2022-04-15 07:40:56,193 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:40:56,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:40:56,194 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:40:56,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:40:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:40:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 07:40:56,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:40:56,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:40:56,204 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:40:56,204 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:40:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:56,206 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:40:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:40:56,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:56,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:56,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:40:56,207 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:40:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:56,208 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:40:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:40:56,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:56,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:56,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:40:56,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:40:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:40:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 07:40:56,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-15 07:40:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:40:56,211 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 07:40:56,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:40:56,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 07:40:56,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 07:40:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:40:56,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:56,240 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 07:40:56,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:56,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-15 07:40:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:56,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295213073] [2022-04-15 07:40:56,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:40:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-15 07:40:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:56,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843530066] [2022-04-15 07:40:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:56,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:40:56,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360933175] [2022-04-15 07:40:56,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:40:56,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:56,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:40:56,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:40:56,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:40:56,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:40:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:40:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:56,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:40:56,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-15 07:40:56,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-15 07:40:56,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:56,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-15 07:40:56,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-15 07:40:56,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-15 07:40:56,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:56,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:40:56,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:40:56,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:56,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-15 07:40:56,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-15 07:40:56,847 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:56,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:40:56,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:40:56,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:40:56,849 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {615#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #63#return; {622#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:40:56,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:56,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:56,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:56,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:40:56,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:40:56,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:56,851 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:56,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:56,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {651#(and (= main_~x~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:40:56,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {655#(and (<= main_~Y~0 50) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:40:56,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (<= main_~Y~0 50) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:40:56,854 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:56,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:56,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-15 07:40:56,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-15 07:40:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:40:56,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:40:57,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-15 07:40:57,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-15 07:40:57,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:57,060 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:57,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:40:57,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:57,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:40:57,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:57,125 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:57,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:57,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:40:57,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:40:57,125 INFO L272 TraceCheckUtils]: 19: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:57,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:57,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:57,128 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-15 07:40:57,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:40:57,129 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-15 07:40:57,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:40:57,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:40:57,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {567#true} is VALID [2022-04-15 07:40:57,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-15 07:40:57,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-15 07:40:57,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-15 07:40:57,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:40:57,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-15 07:40:57,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-15 07:40:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:40:57,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:40:57,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843530066] [2022-04-15 07:40:57,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:40:57,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360933175] [2022-04-15 07:40:57,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360933175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:40:57,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:40:57,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-15 07:40:57,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:40:57,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295213073] [2022-04-15 07:40:57,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295213073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:57,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:57,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:40:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037845243] [2022-04-15 07:40:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:40:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:40:57,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:40:57,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:57,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:57,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:40:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:40:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:40:57,162 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:57,661 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 07:40:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:40:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:40:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:40:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-15 07:40:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-15 07:40:57,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-15 07:40:57,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:57,706 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:40:57,706 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 07:40:57,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:40:57,707 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:40:57,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:40:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 07:40:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 07:40:57,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:40:57,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:40:57,744 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:40:57,744 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:40:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:57,747 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 07:40:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 07:40:57,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:57,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:57,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:40:57,748 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:40:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:57,751 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-15 07:40:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 07:40:57,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:57,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:57,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:40:57,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:40:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:40:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-15 07:40:57,754 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-15 07:40:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:40:57,754 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-15 07:40:57,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:57,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-15 07:40:57,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:40:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:40:57,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:57,803 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:57,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 07:40:58,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 07:40:58,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-15 07:40:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:58,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234307304] [2022-04-15 07:40:58,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:40:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-15 07:40:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:58,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429892527] [2022-04-15 07:40:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:58,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:40:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556823472] [2022-04-15 07:40:58,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:40:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:58,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:40:58,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:40:58,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:40:58,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:40:58,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 07:40:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:58,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:40:58,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-15 07:40:58,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-15 07:40:58,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,264 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-15 07:40:58,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:58,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:58,265 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,267 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:58,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:58,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:40:58,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:40:58,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:40:58,271 INFO L272 TraceCheckUtils]: 28: Hoare triple {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:58,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:58,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-15 07:40:58,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-15 07:40:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:40:58,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:40:58,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-15 07:40:58,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-15 07:40:58,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:58,472 INFO L272 TraceCheckUtils]: 28: Hoare triple {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:58,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:40:58,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:58,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:40:58,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:40:58,477 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:40:58,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,477 INFO L272 TraceCheckUtils]: 19: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:40:58,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:40:58,479 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-15 07:40:58,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-15 07:40:58,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-15 07:40:58,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-15 07:40:58,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-15 07:40:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:40:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:40:58,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429892527] [2022-04-15 07:40:58,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:40:58,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556823472] [2022-04-15 07:40:58,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556823472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:40:58,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:40:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-15 07:40:58,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:40:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234307304] [2022-04-15 07:40:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234307304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:40:58,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:40:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:40:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74258940] [2022-04-15 07:40:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:40:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:40:58,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:40:58,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:58,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:58,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:40:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:40:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:40:58,508 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:58,864 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-15 07:40:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:40:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-15 07:40:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:40:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 07:40:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-15 07:40:58,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-15 07:40:58,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:58,915 INFO L225 Difference]: With dead ends: 56 [2022-04-15 07:40:58,915 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 07:40:58,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:40:58,916 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:40:58,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:40:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 07:40:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-15 07:40:58,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:40:58,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:40:58,953 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:40:58,953 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:40:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:58,955 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-15 07:40:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 07:40:58,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:58,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:58,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-15 07:40:58,956 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-15 07:40:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:40:58,958 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-15 07:40:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 07:40:58,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:40:58,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:40:58,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:40:58,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:40:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:40:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 07:40:58,963 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-15 07:40:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:40:58,963 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 07:40:58,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:40:58,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 07:40:59,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 07:40:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:40:59,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:59,029 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:59,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 07:40:59,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:59,229 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-15 07:40:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:59,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452050512] [2022-04-15 07:40:59,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:40:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-15 07:40:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:59,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975994701] [2022-04-15 07:40:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:59,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:59,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:40:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470353437] [2022-04-15 07:40:59,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:40:59,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:59,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:40:59,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:40:59,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:40:59,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:40:59,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 07:40:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:59,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:40:59,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:40:59,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:40:59,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-15 07:40:59,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:59,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:59,895 INFO L272 TraceCheckUtils]: 19: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:40:59,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:59,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:59,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:59,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1632#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:59,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:40:59,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 07:40:59,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1664#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:40:59,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1668#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:40:59,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {1668#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:40:59,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:59,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:59,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:59,900 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1668#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1684#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:40:59,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1688#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:40:59,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1692#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:40:59,902 INFO L272 TraceCheckUtils]: 35: Hoare triple {1692#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:59,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:59,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:40:59,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:40:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:40:59,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:00,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-15 07:41:00,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-15 07:41:00,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:00,473 INFO L272 TraceCheckUtils]: 35: Hoare triple {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:00,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:00,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:41:00,475 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:41:00,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:00,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:00,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:41:00,476 INFO L272 TraceCheckUtils]: 28: Hoare triple {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:41:00,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:41:00,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:41:00,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {1753#(or (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1749#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:41:00,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#true} assume !!(~x~0 <= ~X~0); {1753#(or (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:41:00,481 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-15 07:41:00,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:41:00,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:41:00,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L272 TraceCheckUtils]: 19: Hoare triple {1576#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-15 07:41:00,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-15 07:41:00,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-15 07:41:00,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-15 07:41:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:41:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:00,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975994701] [2022-04-15 07:41:00,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:00,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470353437] [2022-04-15 07:41:00,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470353437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:00,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:00,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-15 07:41:00,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:00,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452050512] [2022-04-15 07:41:00,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452050512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:00,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:00,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:41:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300612908] [2022-04-15 07:41:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:41:00,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:00,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:00,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:00,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:41:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:00,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:41:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:41:00,513 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:01,242 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 07:41:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:41:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:41:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-15 07:41:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-15 07:41:01,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-15 07:41:01,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:01,308 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:41:01,308 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 07:41:01,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:41:01,309 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:01,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:41:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 07:41:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-15 07:41:01,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:01,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:41:01,343 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:41:01,343 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:41:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:01,344 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 07:41:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 07:41:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:01,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:01,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 07:41:01,349 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 07:41:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:01,354 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 07:41:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-15 07:41:01,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:01,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:01,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:01,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:41:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-15 07:41:01,358 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-15 07:41:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:01,360 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-15 07:41:01,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:01,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-15 07:41:01,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:41:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:41:01,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:01,408 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:41:01,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 07:41:01,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:01,623 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-15 07:41:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:01,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756669280] [2022-04-15 07:41:01,625 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-15 07:41:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:01,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803092614] [2022-04-15 07:41:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:01,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:01,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413049619] [2022-04-15 07:41:01,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:41:01,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:01,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:01,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:41:01,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 07:41:01,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:41:01,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:01,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 07:41:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:01,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:41:12,938 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:41:15,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 07:41:15,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 07:41:15,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-15 07:41:15,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-15 07:41:15,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,376 INFO L272 TraceCheckUtils]: 19: Hoare triple {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:15,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:15,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {2221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:15,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:15,377 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2238#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {2238#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2238#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {2238#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2245#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:41:15,379 INFO L272 TraceCheckUtils]: 28: Hoare triple {2245#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:15,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:15,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {2221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:15,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:15,381 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} {2245#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2261#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {2261#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2261#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:41:15,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {2261#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2268#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:41:15,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {2268#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2272#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:41:15,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {2272#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2276#(and (= main_~xy~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (= main_~yx~0 (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0)))} is VALID [2022-04-15 07:41:15,393 INFO L272 TraceCheckUtils]: 37: Hoare triple {2276#(and (= main_~xy~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (= main_~yx~0 (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:15,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {2280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:15,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {2284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 07:41:15,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 07:41:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:41:15,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:17,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-15 07:41:17,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {2284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-15 07:41:17,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {2280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:17,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {2300#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:17,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2300#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:41:17,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {2308#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:17,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2308#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:41:17,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:17,956 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} {2318#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2304#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:17,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:17,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {2328#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:17,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2328#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:41:17,957 INFO L272 TraceCheckUtils]: 28: Hoare triple {2318#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:17,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2318#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:41:17,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#true} assume !!(~x~0 <= ~X~0); {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2155#true} #65#return; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L272 TraceCheckUtils]: 19: Hoare triple {2155#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-15 07:41:17,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-15 07:41:17,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-15 07:41:17,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-15 07:41:17,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-15 07:41:17,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-15 07:41:17,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-15 07:41:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:41:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803092614] [2022-04-15 07:41:17,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413049619] [2022-04-15 07:41:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413049619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:17,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-15 07:41:17,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756669280] [2022-04-15 07:41:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756669280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:41:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026519746] [2022-04-15 07:41:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:41:17,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:17,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:17,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:17,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:41:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:41:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:41:17,993 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:19,058 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-15 07:41:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:41:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:41:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:41:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:41:19,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 07:41:19,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:19,116 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:41:19,116 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:41:19,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:41:19,117 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:19,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:41:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:41:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 07:41:19,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:19,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:19,172 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:19,172 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:19,174 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 07:41:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 07:41:19,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:19,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:19,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-15 07:41:19,176 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-15 07:41:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:19,177 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 07:41:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 07:41:19,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:19,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:19,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:19,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-04-15 07:41:19,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 41 [2022-04-15 07:41:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:19,181 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-04-15 07:41:19,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:19,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 61 transitions. [2022-04-15 07:41:19,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-15 07:41:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:41:19,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:19,264 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:41:19,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 07:41:19,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:19,484 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-15 07:41:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033629976] [2022-04-15 07:41:19,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-15 07:41:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407731923] [2022-04-15 07:41:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:19,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:19,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:19,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012219141] [2022-04-15 07:41:19,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:41:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:19,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:41:19,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 07:41:19,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:41:19,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:19,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:41:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:19,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:41:19,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #69#return; {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret8 := main(); {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {2772#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:19,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2772#true} {2772#true} #61#return; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2772#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {2772#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2772#true} {2772#true} #63#return; {2772#true} is VALID [2022-04-15 07:41:19,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {2772#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,858 INFO L272 TraceCheckUtils]: 19: Hoare triple {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:19,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:19,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:19,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:19,859 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2772#true} {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {2828#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2853#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {2853#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2861#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:41:19,861 INFO L272 TraceCheckUtils]: 28: Hoare triple {2861#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:19,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {2772#true} ~cond := #in~cond; {2868#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:19,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {2868#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:19,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:19,863 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} {2861#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:41:19,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {2857#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2885#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:41:19,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {2885#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2889#(and (= (+ (- 1) main_~x~0) 1) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-15 07:41:19,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {2889#(and (= (+ (- 1) main_~x~0) 1) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-15 07:41:19,866 INFO L272 TraceCheckUtils]: 37: Hoare triple {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2897#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:19,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {2897#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2901#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:19,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {2901#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2773#false} is VALID [2022-04-15 07:41:19,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-04-15 07:41:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:41:19,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:23,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-04-15 07:41:23,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {2901#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2773#false} is VALID [2022-04-15 07:41:23,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {2897#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2901#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:23,447 INFO L272 TraceCheckUtils]: 37: Hoare triple {2917#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2897#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:23,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2917#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:41:23,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {2925#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:23,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2925#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:41:23,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:23,453 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} {2935#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2921#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:23,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:23,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {2945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2872#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:23,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {2772#true} ~cond := #in~cond; {2945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:41:23,454 INFO L272 TraceCheckUtils]: 28: Hoare triple {2935#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:23,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {2772#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2935#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {2772#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {2772#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {2772#true} assume !!(~x~0 <= ~X~0); {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2772#true} {2772#true} #65#return; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {2772#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {2772#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {2772#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2772#true} {2772#true} #63#return; {2772#true} is VALID [2022-04-15 07:41:23,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L272 TraceCheckUtils]: 12: Hoare triple {2772#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2772#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2772#true} {2772#true} #61#return; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {2772#true} assume !(0 == ~cond); {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {2772#true} ~cond := #in~cond; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {2772#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2772#true} is VALID [2022-04-15 07:41:23,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret8 := main(); {2772#true} is VALID [2022-04-15 07:41:23,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #69#return; {2772#true} is VALID [2022-04-15 07:41:23,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-15 07:41:23,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2772#true} is VALID [2022-04-15 07:41:23,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2022-04-15 07:41:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:41:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407731923] [2022-04-15 07:41:23,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:23,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012219141] [2022-04-15 07:41:23,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012219141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:23,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:23,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-15 07:41:23,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:23,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033629976] [2022-04-15 07:41:23,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033629976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:23,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:23,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:41:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428016691] [2022-04-15 07:41:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:41:23,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:23,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:23,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:23,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:41:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:41:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:41:23,489 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:24,216 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 07:41:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:41:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:41:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:41:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:41:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-15 07:41:24,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-15 07:41:24,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:24,291 INFO L225 Difference]: With dead ends: 72 [2022-04-15 07:41:24,291 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 07:41:24,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:41:24,294 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:41:24,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:41:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 07:41:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-04-15 07:41:24,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:41:24,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:24,339 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:24,339 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:24,341 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 07:41:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 07:41:24,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:24,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:24,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-15 07:41:24,342 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-15 07:41:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:41:24,343 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-15 07:41:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-15 07:41:24,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:41:24,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:41:24,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:41:24,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:41:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:41:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-15 07:41:24,345 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 41 [2022-04-15 07:41:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:41:24,345 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-15 07:41:24,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:24,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-15 07:41:24,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 07:41:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:41:24,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:41:24,434 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:41:24,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 07:41:24,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:24,634 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:41:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:41:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-15 07:41:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540183640] [2022-04-15 07:41:24,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:41:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-15 07:41:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:41:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716763571] [2022-04-15 07:41:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:41:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:41:24,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:41:24,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552444529] [2022-04-15 07:41:24,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:41:24,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:41:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:41:24,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:41:24,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 07:41:24,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:41:24,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:41:24,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:41:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:41:24,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:41:37,162 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:41:41,732 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:41:44,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {3443#true} call ULTIMATE.init(); {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {3443#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3443#true} {3443#true} #69#return; {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {3443#true} call #t~ret8 := main(); {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {3443#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L272 TraceCheckUtils]: 6: Hoare triple {3443#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#true} ~cond := #in~cond; {3443#true} is VALID [2022-04-15 07:41:44,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {3443#true} assume !(0 == ~cond); {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3443#true} {3443#true} #61#return; {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {3443#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {3443#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {3443#true} ~cond := #in~cond; {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {3443#true} assume !(0 == ~cond); {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:44,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3443#true} {3443#true} #63#return; {3443#true} is VALID [2022-04-15 07:41:44,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {3443#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:41:44,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:41:44,155 INFO L272 TraceCheckUtils]: 19: Hoare triple {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:44,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {3443#true} ~cond := #in~cond; {3509#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:44,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {3509#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:44,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:44,157 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:41:44,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-15 07:41:44,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {3499#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3526#(and (= main_~x~0 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:41:44,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {3526#(and (= main_~x~0 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3530#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:41:44,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3534#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:41:44,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {3534#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:44,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {3443#true} ~cond := #in~cond; {3509#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:44,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {3509#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:44,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:44,161 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} {3534#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} #65#return; {3550#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:41:44,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {3550#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} assume !!(~x~0 <= ~X~0); {3550#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-15 07:41:44,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {3550#(and (= (+ (- 1) main_~x~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3557#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (not (< (* main_~Y~0 2) main_~X~0)) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (<= (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)) (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:41:44,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {3557#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (not (< (* main_~Y~0 2) main_~X~0)) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (<= (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)) (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3561#(and (not (< (* main_~Y~0 2) main_~X~0)) (<= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 2)) (< (* main_~Y~0 4) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (= main_~x~0 2) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-15 07:41:44,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {3561#(and (not (< (* main_~Y~0 2) main_~X~0)) (<= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 2)) (< (* main_~Y~0 4) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (= main_~x~0 2) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3565#(and (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (< (* main_~Y~0 4) (+ main_~X~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 6) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0))) (<= (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2) (* main_~X~0 2)) (= (mod main_~xy~0 main_~X~0) 0))} is VALID [2022-04-15 07:41:44,165 INFO L272 TraceCheckUtils]: 37: Hoare triple {3565#(and (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (< (* main_~Y~0 4) (+ main_~X~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 6) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0))) (<= (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2) (* main_~X~0 2)) (= (mod main_~xy~0 main_~X~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:44,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {3569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:44,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {3573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3444#false} is VALID [2022-04-15 07:41:44,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {3444#false} assume !false; {3444#false} is VALID [2022-04-15 07:41:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:41:44,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:41:48,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {3444#false} assume !false; {3444#false} is VALID [2022-04-15 07:41:48,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {3573#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3444#false} is VALID [2022-04-15 07:41:48,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {3569#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:41:48,748 INFO L272 TraceCheckUtils]: 37: Hoare triple {3589#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:41:48,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {3593#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3589#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:41:48,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {3597#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3593#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:41:48,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {3601#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3597#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:41:48,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {3601#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {3601#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:41:48,763 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} {3608#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {3601#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:41:48,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:48,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {3618#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:41:48,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {3443#true} ~cond := #in~cond; {3618#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:41:48,765 INFO L272 TraceCheckUtils]: 28: Hoare triple {3608#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:48,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {3443#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3608#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:41:48,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {3443#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3443#true} is VALID [2022-04-15 07:41:48,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {3443#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3443#true} is VALID [2022-04-15 07:41:48,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {3443#true} assume !!(~x~0 <= ~X~0); {3443#true} is VALID [2022-04-15 07:41:48,765 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3443#true} {3443#true} #65#return; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {3443#true} assume !(0 == ~cond); {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {3443#true} ~cond := #in~cond; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L272 TraceCheckUtils]: 19: Hoare triple {3443#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {3443#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {3443#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3443#true} {3443#true} #63#return; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {3443#true} assume !(0 == ~cond); {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {3443#true} ~cond := #in~cond; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {3443#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {3443#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3443#true} is VALID [2022-04-15 07:41:48,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3443#true} {3443#true} #61#return; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {3443#true} assume !(0 == ~cond); {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#true} ~cond := #in~cond; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {3443#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {3443#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {3443#true} call #t~ret8 := main(); {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3443#true} {3443#true} #69#return; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {3443#true} assume true; {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {3443#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3443#true} is VALID [2022-04-15 07:41:48,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {3443#true} call ULTIMATE.init(); {3443#true} is VALID [2022-04-15 07:41:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:41:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:41:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716763571] [2022-04-15 07:41:48,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:41:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552444529] [2022-04-15 07:41:48,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552444529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:41:48,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:41:48,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-15 07:41:48,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:41:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540183640] [2022-04-15 07:41:48,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540183640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:41:48,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:41:48,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:41:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695329893] [2022-04-15 07:41:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:41:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:41:48,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:41:48,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:48,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:41:48,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:41:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:41:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:41:48,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=1, NotChecked=0, Total=380 [2022-04-15 07:41:48,804 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:41:51,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:41:55,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:41:59,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:42:03,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:42:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:03,852 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-04-15 07:42:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:42:03,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:42:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 07:42:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 07:42:03,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-15 07:42:03,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:03,908 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:42:03,908 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:42:03,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=98, Invalid=500, Unknown=2, NotChecked=0, Total=600 [2022-04-15 07:42:03,909 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:03,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 184 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-04-15 07:42:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:42:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 07:42:03,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:03,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:03,988 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:03,988 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:03,990 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-15 07:42:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:42:03,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:03,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:03,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 07:42:03,990 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 07:42:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:03,992 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-15 07:42:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:42:03,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:03,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:03,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:03,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:42:03,994 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-15 07:42:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:03,994 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:42:03,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:03,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:42:04,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:42:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:42:04,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:04,115 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:04,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:42:04,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:04,316 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-15 07:42:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:04,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049650540] [2022-04-15 07:42:04,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-15 07:42:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070755399] [2022-04-15 07:42:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:04,328 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480114947] [2022-04-15 07:42:04,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:42:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:04,343 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:42:04,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 07:42:04,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:42:04,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:04,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 07:42:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:04,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:04,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {4182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #69#return; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret8 := main(); {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {4182#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {4182#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4182#true} {4182#true} #61#return; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {4182#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4182#true} is VALID [2022-04-15 07:42:04,675 INFO L272 TraceCheckUtils]: 12: Hoare triple {4182#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:04,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:04,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:04,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:04,676 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4182#true} {4182#true} #63#return; {4182#true} is VALID [2022-04-15 07:42:04,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {4182#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:04,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:04,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:04,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:04,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:04,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:04,678 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4182#true} {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:04,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:04,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {4238#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4263#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {4263#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,679 INFO L272 TraceCheckUtils]: 28: Hoare triple {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:04,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:04,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:04,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:04,680 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4182#true} {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #65#return; {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {4267#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {4289#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {4289#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4293#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:42:04,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {4293#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4297#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:04,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {4297#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4301#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 2) main_~yx~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= 1 main_~X~0))} is VALID [2022-04-15 07:42:04,683 INFO L272 TraceCheckUtils]: 37: Hoare triple {4301#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 2) main_~yx~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:04,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {4305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:04,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {4309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4183#false} is VALID [2022-04-15 07:42:04,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2022-04-15 07:42:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:42:04,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:42:05,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2022-04-15 07:42:05,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {4309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4183#false} is VALID [2022-04-15 07:42:05,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {4305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:05,024 INFO L272 TraceCheckUtils]: 37: Hoare triple {4325#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:05,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {4329#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4325#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:42:05,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {4333#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4329#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:05,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {4337#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4333#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:42:05,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {4337#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:42:05,029 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4182#true} {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:42:05,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:05,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:05,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:05,029 INFO L272 TraceCheckUtils]: 28: Hoare triple {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:05,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:42:05,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {4363#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4341#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:42:05,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4363#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} is VALID [2022-04-15 07:42:05,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !!(~x~0 <= ~X~0); {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:42:05,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4182#true} {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #65#return; {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:42:05,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:05,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:05,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:05,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:05,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {4182#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4367#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:42:05,035 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4182#true} {4182#true} #63#return; {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L272 TraceCheckUtils]: 12: Hoare triple {4182#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {4182#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4182#true} {4182#true} #61#return; {4182#true} is VALID [2022-04-15 07:42:05,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {4182#true} assume !(0 == ~cond); {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {4182#true} ~cond := #in~cond; {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {4182#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {4182#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret8 := main(); {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #69#return; {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {4182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4182#true} is VALID [2022-04-15 07:42:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:42:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:42:05,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070755399] [2022-04-15 07:42:05,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:42:05,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480114947] [2022-04-15 07:42:05,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480114947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:42:05,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:42:05,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-15 07:42:05,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:42:05,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049650540] [2022-04-15 07:42:05,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049650540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:42:05,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:42:05,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:42:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175173648] [2022-04-15 07:42:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:42:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:42:05,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:42:05,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:05,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:05,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:42:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:42:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:42:05,078 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:05,695 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-04-15 07:42:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:42:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:42:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 07:42:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 07:42:05,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 07:42:05,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:05,753 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:42:05,753 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 07:42:05,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:42:05,753 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:05,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:42:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 07:42:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-04-15 07:42:05,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:05,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:05,827 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:05,832 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:05,841 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:42:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:42:05,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:05,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:05,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:42:05,842 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-15 07:42:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:05,844 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-15 07:42:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-15 07:42:05,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:05,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:05,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:05,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:42:05,845 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-15 07:42:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:05,846 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:42:05,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:42:05,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:42:05,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:42:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:42:05,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:05,960 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:05,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 07:42:06,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 07:42:06,164 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 1 times [2022-04-15 07:42:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484788828] [2022-04-15 07:42:06,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 2 times [2022-04-15 07:42:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485522995] [2022-04-15 07:42:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:06,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:06,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148094781] [2022-04-15 07:42:06,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:42:06,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:06,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:42:06,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 07:42:06,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:42:06,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:06,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:42:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:06,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:06,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {4935#true} call ULTIMATE.init(); {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {4935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4935#true} {4935#true} #69#return; {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {4935#true} call #t~ret8 := main(); {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {4935#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {4935#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4935#true} {4935#true} #61#return; {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L272 TraceCheckUtils]: 12: Hoare triple {4935#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4935#true} {4935#true} #63#return; {4935#true} is VALID [2022-04-15 07:42:06,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {4935#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:42:06,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:42:06,891 INFO L272 TraceCheckUtils]: 19: Hoare triple {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:06,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:06,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:06,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,891 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4935#true} {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:42:06,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:42:06,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {4991#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5016#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:42:06,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {5016#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:42:06,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:42:06,894 INFO L272 TraceCheckUtils]: 28: Hoare triple {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:06,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:06,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:06,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,895 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4935#true} {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:42:06,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:42:06,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {5020#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5045#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:42:06,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {5045#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:42:06,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:42:06,897 INFO L272 TraceCheckUtils]: 37: Hoare triple {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:06,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:06,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:06,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:06,897 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4935#true} {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:42:06,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {5049#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {4936#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L272 TraceCheckUtils]: 44: Hoare triple {4936#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {4936#false} ~cond := #in~cond; {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {4936#false} assume 0 == ~cond; {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {4936#false} assume !false; {4936#false} is VALID [2022-04-15 07:42:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:42:06,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:42:07,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {4936#false} assume !false; {4936#false} is VALID [2022-04-15 07:42:07,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {4936#false} assume 0 == ~cond; {4936#false} is VALID [2022-04-15 07:42:07,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {4936#false} ~cond := #in~cond; {4936#false} is VALID [2022-04-15 07:42:07,159 INFO L272 TraceCheckUtils]: 44: Hoare triple {4936#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4936#false} is VALID [2022-04-15 07:42:07,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {4936#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4936#false} is VALID [2022-04-15 07:42:07,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {5101#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {4936#false} is VALID [2022-04-15 07:42:07,160 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4935#true} {5101#(<= main_~x~0 main_~X~0)} #65#return; {5101#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:42:07,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:07,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:07,160 INFO L272 TraceCheckUtils]: 37: Hoare triple {5101#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:07,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {5101#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5101#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:42:07,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {5123#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5101#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:42:07,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5123#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:42:07,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:42:07,165 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4935#true} {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:42:07,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:07,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:07,165 INFO L272 TraceCheckUtils]: 28: Hoare triple {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:07,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:42:07,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {5152#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5127#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:42:07,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5152#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:42:07,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:42:07,167 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4935#true} {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #65#return; {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:42:07,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:07,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:07,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:07,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {4935#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5156#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:42:07,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4935#true} {4935#true} #63#return; {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {4935#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {4935#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4935#true} {4935#true} #61#return; {4935#true} is VALID [2022-04-15 07:42:07,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {4935#true} assume !(0 == ~cond); {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {4935#true} ~cond := #in~cond; {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {4935#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {4935#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {4935#true} call #t~ret8 := main(); {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4935#true} {4935#true} #69#return; {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {4935#true} assume true; {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {4935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {4935#true} call ULTIMATE.init(); {4935#true} is VALID [2022-04-15 07:42:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:42:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:42:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485522995] [2022-04-15 07:42:07,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:42:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148094781] [2022-04-15 07:42:07,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148094781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:42:07,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:42:07,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 07:42:07,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:42:07,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484788828] [2022-04-15 07:42:07,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484788828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:42:07,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:42:07,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:42:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035637833] [2022-04-15 07:42:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:42:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:42:07,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:42:07,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:07,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:07,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:42:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:42:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:42:07,190 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:07,456 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 07:42:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:42:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:42:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 07:42:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 07:42:07,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-15 07:42:07,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:07,504 INFO L225 Difference]: With dead ends: 87 [2022-04-15 07:42:07,504 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:42:07,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:42:07,504 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:07,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:42:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:42:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-15 07:42:07,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:07,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:42:07,605 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:42:07,605 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:42:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:07,607 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:42:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:42:07,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:07,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:07,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-15 07:42:07,607 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-15 07:42:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:07,609 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:42:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:42:07,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:07,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:07,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:07,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 07:42:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-04-15 07:42:07,611 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 48 [2022-04-15 07:42:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:07,611 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-04-15 07:42:07,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:07,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2022-04-15 07:42:07,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-15 07:42:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:42:07,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:07,742 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:07,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 07:42:07,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 07:42:07,942 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-15 07:42:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718351536] [2022-04-15 07:42:07,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-15 07:42:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960731817] [2022-04-15 07:42:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:07,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:07,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982400961] [2022-04-15 07:42:07,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:42:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:07,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:42:07,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 07:42:07,999 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:42:07,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:08,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 07:42:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:08,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:08,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {5718#true} call ULTIMATE.init(); {5718#true} is VALID [2022-04-15 07:42:08,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {5718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5718#true} is VALID [2022-04-15 07:42:08,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5718#true} {5718#true} #69#return; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {5718#true} call #t~ret8 := main(); {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {5718#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {5718#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5718#true} {5718#true} #61#return; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {5718#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L272 TraceCheckUtils]: 12: Hoare triple {5718#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5718#true} {5718#true} #63#return; {5718#true} is VALID [2022-04-15 07:42:08,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {5718#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5774#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:08,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {5774#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5774#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:08,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {5774#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,474 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5718#true} {5774#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {5774#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:08,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {5774#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {5774#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:08,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {5774#(and (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5799#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:42:08,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {5799#(and (= main_~x~0 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5803#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:42:08,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {5803#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5803#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:42:08,476 INFO L272 TraceCheckUtils]: 28: Hoare triple {5803#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {5718#true} ~cond := #in~cond; {5813#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:08,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {5813#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,477 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} {5803#(and (= main_~y~0 1) (= main_~x~0 1))} #65#return; {5803#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:42:08,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {5803#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~x~0 <= ~X~0); {5827#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:42:08,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {5827#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5831#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (= main_~x~0 1))} is VALID [2022-04-15 07:42:08,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {5831#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5835#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:08,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {5835#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5839#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:08,479 INFO L272 TraceCheckUtils]: 37: Hoare triple {5839#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {5718#true} ~cond := #in~cond; {5813#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:08,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {5813#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,481 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} {5839#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {5855#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:08,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {5855#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {5859#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:42:08,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {5859#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5863#(and (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (not (<= 2 main_~X~0)))} is VALID [2022-04-15 07:42:08,483 INFO L272 TraceCheckUtils]: 44: Hoare triple {5863#(and (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:08,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {5867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:08,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {5871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5719#false} is VALID [2022-04-15 07:42:08,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {5719#false} assume !false; {5719#false} is VALID [2022-04-15 07:42:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:42:08,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:42:08,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {5719#false} assume !false; {5719#false} is VALID [2022-04-15 07:42:08,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {5871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5719#false} is VALID [2022-04-15 07:42:08,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {5867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:08,975 INFO L272 TraceCheckUtils]: 44: Hoare triple {5887#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:08,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {5891#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5887#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:08,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {5895#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {5891#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:42:08,977 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {5895#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:08,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {5909#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:08,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {5718#true} ~cond := #in~cond; {5909#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:42:08,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {5916#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:08,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {5920#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5916#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:08,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {5924#(or (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5920#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {5718#true} assume !!(~x~0 <= ~X~0); {5924#(or (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:42:08,984 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5718#true} {5718#true} #65#return; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L272 TraceCheckUtils]: 28: Hoare triple {5718#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {5718#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {5718#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {5718#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {5718#true} assume !!(~x~0 <= ~X~0); {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5718#true} {5718#true} #65#return; {5718#true} is VALID [2022-04-15 07:42:08,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L272 TraceCheckUtils]: 19: Hoare triple {5718#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {5718#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {5718#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5718#true} {5718#true} #63#return; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L272 TraceCheckUtils]: 12: Hoare triple {5718#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {5718#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5718#true} {5718#true} #61#return; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {5718#true} assume !(0 == ~cond); {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {5718#true} ~cond := #in~cond; {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {5718#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {5718#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {5718#true} call #t~ret8 := main(); {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5718#true} {5718#true} #69#return; {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {5718#true} assume true; {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {5718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {5718#true} call ULTIMATE.init(); {5718#true} is VALID [2022-04-15 07:42:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:42:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:42:08,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960731817] [2022-04-15 07:42:08,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:42:08,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982400961] [2022-04-15 07:42:08,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982400961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:42:08,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:42:08,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-15 07:42:08,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:42:08,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718351536] [2022-04-15 07:42:08,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718351536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:42:08,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:42:08,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:42:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071273362] [2022-04-15 07:42:08,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:42:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:42:08,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:42:08,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:09,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:09,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:42:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:42:09,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:42:09,020 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:09,923 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 07:42:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:42:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:42:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2022-04-15 07:42:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2022-04-15 07:42:09,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 61 transitions. [2022-04-15 07:42:09,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:09,980 INFO L225 Difference]: With dead ends: 87 [2022-04-15 07:42:09,980 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:42:09,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:42:09,980 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:09,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 211 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:42:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:42:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2022-04-15 07:42:10,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:10,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:10,071 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:10,071 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:10,072 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:42:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:42:10,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:10,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:10,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-15 07:42:10,073 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-15 07:42:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:10,075 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 07:42:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-15 07:42:10,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:10,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:10,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:10,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-15 07:42:10,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 48 [2022-04-15 07:42:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:10,077 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-15 07:42:10,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:10,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-15 07:42:10,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-15 07:42:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:42:10,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:10,183 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:10,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 07:42:10,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 07:42:10,402 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 5 times [2022-04-15 07:42:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:10,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930550537] [2022-04-15 07:42:10,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 6 times [2022-04-15 07:42:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:10,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443490393] [2022-04-15 07:42:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:10,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:10,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814970589] [2022-04-15 07:42:10,412 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:42:10,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:10,415 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:42:10,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 07:42:10,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:42:10,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:10,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 07:42:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:10,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:13,460 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:27,651 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:35,879 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:38,163 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:42:38,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {6517#true} call ULTIMATE.init(); {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {6517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6517#true} {6517#true} #69#return; {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {6517#true} call #t~ret8 := main(); {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {6517#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {6517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:38,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:38,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:38,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6517#true} {6517#true} #61#return; {6517#true} is VALID [2022-04-15 07:42:38,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6517#true} is VALID [2022-04-15 07:42:38,469 INFO L272 TraceCheckUtils]: 12: Hoare triple {6517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:38,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {6517#true} ~cond := #in~cond; {6561#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:42:38,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {6561#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:42:38,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {6565#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:42:38,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6565#(not (= |assume_abort_if_not_#in~cond| 0))} {6517#true} #63#return; {6572#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:42:38,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {6572#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:38,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:38,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:38,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:38,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:38,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:38,472 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6517#true} {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:38,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:42:38,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {6576#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6601#(and (= main_~x~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:42:38,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {6601#(and (= main_~x~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6605#(and (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:42:38,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {6605#(and (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6609#(and (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:42:38,474 INFO L272 TraceCheckUtils]: 28: Hoare triple {6609#(and (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:38,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {6517#true} ~cond := #in~cond; {6616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:38,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {6616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:38,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:38,476 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} {6609#(and (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {6627#(and (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:42:38,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {6627#(and (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {6627#(and (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:42:38,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {6627#(and (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6634#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)))) (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:42:38,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {6634#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)))) (<= main_~x~0 1) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6638#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:42:38,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {6638#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6642#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:42:38,478 INFO L272 TraceCheckUtils]: 37: Hoare triple {6642#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:38,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {6517#true} ~cond := #in~cond; {6616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:38,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {6616#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:38,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:38,480 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} {6642#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} #65#return; {6658#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:42:38,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {6658#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {6658#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-15 07:42:38,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {6658#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6665#(and (= (* main_~Y~0 6) (+ (* main_~Y~0 main_~x~0 2) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:42:38,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {6665#(and (= (* main_~Y~0 6) (+ (* main_~Y~0 main_~x~0 2) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6669#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (<= main_~x~0 3) (= main_~y~0 0))} is VALID [2022-04-15 07:42:38,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {6669#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (<= main_~x~0 3) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6673#(and (= (+ main_~X~0 main_~v~0) (+ (* 2 (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0))) (* main_~Y~0 2))) (= main_~xy~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0))} is VALID [2022-04-15 07:42:38,487 INFO L272 TraceCheckUtils]: 46: Hoare triple {6673#(and (= (+ main_~X~0 main_~v~0) (+ (* 2 (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0))) (* main_~Y~0 2))) (= main_~xy~0 0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:38,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {6677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:38,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {6681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6518#false} is VALID [2022-04-15 07:42:38,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {6518#false} assume !false; {6518#false} is VALID [2022-04-15 07:42:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 07:42:38,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:42:40,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {6518#false} assume !false; {6518#false} is VALID [2022-04-15 07:42:40,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {6681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6518#false} is VALID [2022-04-15 07:42:40,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {6677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:42:40,619 INFO L272 TraceCheckUtils]: 46: Hoare triple {6697#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:42:40,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6697#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:42:40,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {6705#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:40,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6705#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:42:40,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:40,623 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} {6715#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {6701#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:42:40,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:40,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {6725#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:42:40,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {6517#true} ~cond := #in~cond; {6725#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:42:40,624 INFO L272 TraceCheckUtils]: 37: Hoare triple {6715#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {6517#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6715#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {6517#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {6517#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {6517#true} assume !!(~x~0 <= ~X~0); {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6517#true} {6517#true} #65#return; {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:40,625 INFO L272 TraceCheckUtils]: 28: Hoare triple {6517#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {6517#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {6517#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {6517#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {6517#true} assume !!(~x~0 <= ~X~0); {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6517#true} {6517#true} #65#return; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {6517#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {6517#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {6517#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6517#true} {6517#true} #63#return; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:40,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {6517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6517#true} {6517#true} #61#return; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {6517#true} assume !(0 == ~cond); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {6517#true} ~cond := #in~cond; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {6517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {6517#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {6517#true} call #t~ret8 := main(); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6517#true} {6517#true} #69#return; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {6517#true} assume true; {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {6517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6517#true} is VALID [2022-04-15 07:42:40,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {6517#true} call ULTIMATE.init(); {6517#true} is VALID [2022-04-15 07:42:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:42:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:42:40,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443490393] [2022-04-15 07:42:40,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:42:40,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814970589] [2022-04-15 07:42:40,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814970589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:42:40,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:42:40,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2022-04-15 07:42:40,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:42:40,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930550537] [2022-04-15 07:42:40,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930550537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:42:40,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:42:40,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:42:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738617957] [2022-04-15 07:42:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:42:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:42:40,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:42:40,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:40,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:40,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 07:42:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 07:42:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:42:40,669 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:42,202 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-15 07:42:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:42:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:42:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:42:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:42:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:42:42,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2022-04-15 07:42:42,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:42,276 INFO L225 Difference]: With dead ends: 92 [2022-04-15 07:42:42,276 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:42:42,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:42:42,277 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:42:42,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 102 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:42:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:42:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-15 07:42:42,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:42:42,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:42,389 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:42,390 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:42,391 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-15 07:42:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-04-15 07:42:42,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:42,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:42,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-15 07:42:42,392 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-15 07:42:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:42:42,393 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-15 07:42:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-04-15 07:42:42,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:42:42,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:42:42,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:42:42,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:42:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:42:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-04-15 07:42:42,395 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 50 [2022-04-15 07:42:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:42:42,395 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-04-15 07:42:42,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:42:42,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 86 transitions. [2022-04-15 07:42:42,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:42:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-04-15 07:42:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:42:42,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:42:42,568 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:42:42,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 07:42:42,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 07:42:42,768 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:42:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:42:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-15 07:42:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:42:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042698835] [2022-04-15 07:42:42,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:42:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-15 07:42:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:42:42,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447453205] [2022-04-15 07:42:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:42:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:42:42,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:42:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836074712] [2022-04-15 07:42:42,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:42:42,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:42:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:42:42,785 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:42:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 07:42:42,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:42:42,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:42:42,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 07:42:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:42:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:42:46,091 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:43:09,400 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:43:15,418 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:43:17,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {7374#true} call ULTIMATE.init(); {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {7374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7374#true} {7374#true} #69#return; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {7374#true} call #t~ret8 := main(); {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {7374#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7374#true} {7374#true} #61#return; {7374#true} is VALID [2022-04-15 07:43:17,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {7374#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {7374#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7374#true} {7374#true} #63#return; {7374#true} is VALID [2022-04-15 07:43:17,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {7374#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,904 INFO L272 TraceCheckUtils]: 19: Hoare triple {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:17,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:17,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:17,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:17,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7374#true} {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {7430#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7455#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {7455#(and (= main_~x~0 0) (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7459#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {7459#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7463#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:43:17,907 INFO L272 TraceCheckUtils]: 28: Hoare triple {7463#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:17,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {7374#true} ~cond := #in~cond; {7470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:43:17,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:17,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:17,908 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} {7463#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {7481#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {7481#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7481#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:43:17,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {7481#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7488#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:43:19,911 WARN L290 TraceCheckUtils]: 35: Hoare triple {7488#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7492#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= main_~y~0 0) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (<= 2 main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= 1 (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0)) (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} is UNKNOWN [2022-04-15 07:43:19,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {7492#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= main_~y~0 0) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (<= 2 main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= 1 (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0)) (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7496#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (<= 2 main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= 1 (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0)) (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} is VALID [2022-04-15 07:43:19,913 INFO L272 TraceCheckUtils]: 37: Hoare triple {7496#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (<= 2 main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= 1 (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0)) (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:19,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {7374#true} ~cond := #in~cond; {7470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:43:19,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:19,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:19,916 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} {7496#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (<= 2 main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= 1 (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0)) (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} #65#return; {7512#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:43:19,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {7512#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7512#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:43:19,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {7512#(and (<= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (< main_~v~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7519#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (<= 2 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))))} is VALID [2022-04-15 07:43:19,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {7519#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (<= 2 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7523#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (= (+ (- 1) main_~y~0) 0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 3 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:43:19,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {7523#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (= (+ (- 1) main_~y~0) 0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 3 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7527#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (<= 3 (div main_~yx~0 main_~Y~0)) (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (= main_~X~0 main_~xy~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (mod main_~yx~0 main_~Y~0) 0))} is VALID [2022-04-15 07:43:19,922 INFO L272 TraceCheckUtils]: 46: Hoare triple {7527#(and (<= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 8)) (<= 3 (div main_~yx~0 main_~Y~0)) (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 6)) (= main_~X~0 main_~xy~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (mod main_~yx~0 main_~Y~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:43:19,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {7531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:43:19,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {7535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7375#false} is VALID [2022-04-15 07:43:19,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {7375#false} assume !false; {7375#false} is VALID [2022-04-15 07:43:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:43:19,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:43:22,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {7375#false} assume !false; {7375#false} is VALID [2022-04-15 07:43:22,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {7535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7375#false} is VALID [2022-04-15 07:43:22,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {7531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:43:22,889 INFO L272 TraceCheckUtils]: 46: Hoare triple {7551#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:43:22,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {7555#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7551#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:43:22,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {7559#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7555#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:43:22,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {7563#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7559#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:43:22,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {7563#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {7563#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:43:22,894 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} {7570#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {7563#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:43:22,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:22,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {7580#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:43:22,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {7374#true} ~cond := #in~cond; {7580#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:43:22,896 INFO L272 TraceCheckUtils]: 37: Hoare triple {7570#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:22,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {7374#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7570#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:43:22,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {7374#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7374#true} is VALID [2022-04-15 07:43:22,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {7374#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7374#true} is VALID [2022-04-15 07:43:22,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {7374#true} assume !!(~x~0 <= ~X~0); {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7374#true} {7374#true} #65#return; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {7374#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {7374#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {7374#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {7374#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {7374#true} assume !!(~x~0 <= ~X~0); {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7374#true} {7374#true} #65#return; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:22,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {7374#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {7374#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {7374#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7374#true} {7374#true} #63#return; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {7374#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {7374#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7374#true} {7374#true} #61#return; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {7374#true} assume !(0 == ~cond); {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {7374#true} ~cond := #in~cond; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {7374#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {7374#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7374#true} is VALID [2022-04-15 07:43:22,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {7374#true} call #t~ret8 := main(); {7374#true} is VALID [2022-04-15 07:43:22,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7374#true} {7374#true} #69#return; {7374#true} is VALID [2022-04-15 07:43:22,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {7374#true} assume true; {7374#true} is VALID [2022-04-15 07:43:22,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {7374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7374#true} is VALID [2022-04-15 07:43:22,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {7374#true} call ULTIMATE.init(); {7374#true} is VALID [2022-04-15 07:43:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:43:22,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:43:22,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447453205] [2022-04-15 07:43:22,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:43:22,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836074712] [2022-04-15 07:43:22,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836074712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:43:22,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:43:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2022-04-15 07:43:22,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:43:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042698835] [2022-04-15 07:43:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042698835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:43:22,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:43:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:43:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197518570] [2022-04-15 07:43:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:43:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:43:22,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:43:22,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:43:24,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:43:24,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:43:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:43:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:43:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=481, Unknown=2, NotChecked=0, Total=552 [2022-04-15 07:43:24,946 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:43:27,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:43:33,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:43:55,753 WARN L232 SmtUtils]: Spent 18.11s on a formula simplification. DAG size of input: 54 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:44:01,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:44:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:01,116 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-04-15 07:44:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:44:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:44:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-15 07:44:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-15 07:44:01,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 69 transitions. [2022-04-15 07:44:03,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 68 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:03,312 INFO L225 Difference]: With dead ends: 96 [2022-04-15 07:44:03,312 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:44:03,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=108, Invalid=701, Unknown=3, NotChecked=0, Total=812 [2022-04-15 07:44:03,314 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:44:03,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 240 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 519 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 07:44:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:44:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-15 07:44:03,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:44:03,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:44:03,447 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:44:03,447 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:44:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:03,448 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-15 07:44:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-04-15 07:44:03,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:03,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:03,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-15 07:44:03,449 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-15 07:44:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:03,450 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-15 07:44:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-04-15 07:44:03,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:03,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:03,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:44:03,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:44:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:44:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-04-15 07:44:03,453 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 50 [2022-04-15 07:44:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:44:03,453 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-04-15 07:44:03,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.0) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:03,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 86 transitions. [2022-04-15 07:44:03,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-04-15 07:44:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:44:03,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:44:03,655 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:44:03,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 07:44:03,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 07:44:03,874 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:44:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:44:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-15 07:44:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:03,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137844608] [2022-04-15 07:44:03,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:44:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-15 07:44:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:44:03,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986779869] [2022-04-15 07:44:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:44:03,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:44:03,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:44:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192793561] [2022-04-15 07:44:03,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:44:03,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:44:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:44:03,901 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:44:03,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 07:44:03,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:44:03,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:44:03,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:44:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:44:03,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:44:08,418 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:44:11,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-15 07:44:11,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #69#return; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret8 := main(); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #61#return; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:11,618 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #63#return; {8234#true} is VALID [2022-04-15 07:44:11,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {8234#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:44:11,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:44:11,619 INFO L272 TraceCheckUtils]: 19: Hoare triple {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:11,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:11,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:11,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:11,620 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8234#true} {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:44:11,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:44:11,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {8290#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:11,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:11,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:11,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:11,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} ~cond := #in~cond; {8328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:11,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {8328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:11,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:11,623 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:11,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:11,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {8315#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8345#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} is VALID [2022-04-15 07:44:11,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {8345#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8345#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} is VALID [2022-04-15 07:44:11,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {8345#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8352#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:44:11,625 INFO L272 TraceCheckUtils]: 37: Hoare triple {8352#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:11,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {8234#true} ~cond := #in~cond; {8328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:11,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {8328#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:11,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:11,628 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} {8352#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {8368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} is VALID [2022-04-15 07:44:11,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {8368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} assume !!(~x~0 <= ~X~0); {8368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} is VALID [2022-04-15 07:44:11,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {8368#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 3))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8375#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:44:11,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {8375#(and (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8379#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} is VALID [2022-04-15 07:44:11,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {8379#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8383#(and (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~X~0 main_~xy~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:44:11,635 INFO L272 TraceCheckUtils]: 46: Hoare triple {8383#(and (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~X~0 main_~xy~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:44:11,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {8387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:11,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {8391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8235#false} is VALID [2022-04-15 07:44:11,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-15 07:44:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:44:11,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:44:14,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-15 07:44:14,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {8391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8235#false} is VALID [2022-04-15 07:44:14,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {8387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:14,987 INFO L272 TraceCheckUtils]: 46: Hoare triple {8407#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:44:14,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8407#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:44:14,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {8415#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:14,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8415#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:44:14,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:14,992 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} {8425#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {8411#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:14,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:14,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {8435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:14,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {8234#true} ~cond := #in~cond; {8435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:44:14,993 INFO L272 TraceCheckUtils]: 37: Hoare triple {8425#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {8234#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8425#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {8234#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {8234#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {8234#true} assume !!(~x~0 <= ~X~0); {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8234#true} {8234#true} #65#return; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L272 TraceCheckUtils]: 28: Hoare triple {8234#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8234#true} is VALID [2022-04-15 07:44:14,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {8234#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !!(~x~0 <= ~X~0); {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8234#true} {8234#true} #65#return; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L272 TraceCheckUtils]: 19: Hoare triple {8234#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {8234#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #63#return; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:14,995 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #61#return; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret8 := main(); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #69#return; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-15 07:44:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:44:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:44:14,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986779869] [2022-04-15 07:44:14,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:44:14,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192793561] [2022-04-15 07:44:14,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192793561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:44:14,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:44:14,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-15 07:44:14,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:44:14,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137844608] [2022-04-15 07:44:14,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137844608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:44:14,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:44:14,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:44:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703726616] [2022-04-15 07:44:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:44:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:14,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:44:14,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:15,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:15,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:44:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:44:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:44:15,038 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:17,274 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2022-04-15 07:44:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:44:17,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:44:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-15 07:44:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-15 07:44:17,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-04-15 07:44:17,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:17,338 INFO L225 Difference]: With dead ends: 97 [2022-04-15 07:44:17,338 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 07:44:17,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:44:17,339 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:44:17,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:44:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 07:44:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2022-04-15 07:44:17,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:44:17,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:44:17,503 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:44:17,503 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:44:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:17,504 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-04-15 07:44:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-04-15 07:44:17,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:17,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:17,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-15 07:44:17,505 INFO L87 Difference]: Start difference. First operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-15 07:44:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:17,506 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-04-15 07:44:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-04-15 07:44:17,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:17,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:17,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:44:17,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:44:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.121212121212121) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:44:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-04-15 07:44:17,508 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 50 [2022-04-15 07:44:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:44:17,508 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-04-15 07:44:17,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:17,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2022-04-15 07:44:17,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-04-15 07:44:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:44:17,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:44:17,724 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:44:17,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 07:44:17,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 07:44:17,933 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:44:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:44:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 9 times [2022-04-15 07:44:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:17,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760768848] [2022-04-15 07:44:17,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:44:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 10 times [2022-04-15 07:44:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:44:17,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823340457] [2022-04-15 07:44:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:44:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:44:17,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:44:17,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218072568] [2022-04-15 07:44:17,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:44:17,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:44:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:44:17,951 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:44:17,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 07:44:17,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:44:17,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:44:17,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:44:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:44:17,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:44:18,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-15 07:44:18,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #69#return; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret8 := main(); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {9126#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9126#true} {9126#true} #61#return; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L272 TraceCheckUtils]: 12: Hoare triple {9126#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9126#true} {9126#true} #63#return; {9126#true} is VALID [2022-04-15 07:44:18,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:18,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:18,302 INFO L272 TraceCheckUtils]: 19: Hoare triple {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,303 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9126#true} {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} #65#return; {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:18,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:18,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {9182#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:18,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:18,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:18,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,306 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9126#true} {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #65#return; {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:18,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:18,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {9207#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:44:18,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:44:18,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:44:18,307 INFO L272 TraceCheckUtils]: 37: Hoare triple {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,308 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9126#true} {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #65#return; {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:44:18,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !!(~x~0 <= ~X~0); {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {9235#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {9127#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {9127#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L272 TraceCheckUtils]: 46: Hoare triple {9127#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-15 07:44:18,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-15 07:44:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:44:18,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:44:18,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L272 TraceCheckUtils]: 46: Hoare triple {9127#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {9127#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {9127#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {9299#(< main_~v~0 0)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9127#false} is VALID [2022-04-15 07:44:18,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {9299#(< main_~v~0 0)} assume !!(~x~0 <= ~X~0); {9299#(< main_~v~0 0)} is VALID [2022-04-15 07:44:18,492 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9126#true} {9299#(< main_~v~0 0)} #65#return; {9299#(< main_~v~0 0)} is VALID [2022-04-15 07:44:18,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,492 INFO L272 TraceCheckUtils]: 37: Hoare triple {9299#(< main_~v~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {9299#(< main_~v~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9299#(< main_~v~0 0)} is VALID [2022-04-15 07:44:18,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {9299#(< main_~v~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9299#(< main_~v~0 0)} is VALID [2022-04-15 07:44:18,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9299#(< main_~v~0 0)} is VALID [2022-04-15 07:44:18,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !!(~x~0 <= ~X~0); {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:44:18,494 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9126#true} {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #65#return; {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:44:18,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,495 INFO L272 TraceCheckUtils]: 28: Hoare triple {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:44:18,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:44:18,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9327#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-15 07:44:18,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:44:18,497 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9126#true} {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} #65#return; {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:44:18,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,497 INFO L272 TraceCheckUtils]: 19: Hoare triple {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:44:18,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9355#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:44:18,498 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9126#true} {9126#true} #63#return; {9126#true} is VALID [2022-04-15 07:44:18,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,498 INFO L272 TraceCheckUtils]: 12: Hoare triple {9126#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {9126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9126#true} {9126#true} #61#return; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {9126#true} assume !(0 == ~cond); {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {9126#true} ~cond := #in~cond; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {9126#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {9126#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret8 := main(); {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #69#return; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2022-04-15 07:44:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:44:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:44:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823340457] [2022-04-15 07:44:18,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:44:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218072568] [2022-04-15 07:44:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218072568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:44:18,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:44:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 07:44:18,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:44:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760768848] [2022-04-15 07:44:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760768848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:44:18,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:44:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:44:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482158524] [2022-04-15 07:44:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:44:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:18,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:44:18,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:18,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:18,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:44:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:44:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:44:18,530 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:18,974 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-04-15 07:44:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:44:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:44:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:44:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 07:44:18,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 07:44:19,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:19,032 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:44:19,032 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 07:44:19,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:44:19,033 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:44:19,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:44:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 07:44:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2022-04-15 07:44:19,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:44:19,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:44:19,298 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:44:19,298 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:44:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:19,300 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-04-15 07:44:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-04-15 07:44:19,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:19,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:19,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 113 states. [2022-04-15 07:44:19,301 INFO L87 Difference]: Start difference. First operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 113 states. [2022-04-15 07:44:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:19,303 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-04-15 07:44:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-04-15 07:44:19,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:19,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:19,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:44:19,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:44:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.125) internal successors, (90), 82 states have internal predecessors, (90), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:44:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2022-04-15 07:44:19,305 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 50 [2022-04-15 07:44:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:44:19,305 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2022-04-15 07:44:19,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:19,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 124 transitions. [2022-04-15 07:44:19,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2022-04-15 07:44:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:44:19,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:44:19,606 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:44:19,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 07:44:19,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:44:19,806 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:44:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:44:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-15 07:44:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:19,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288489428] [2022-04-15 07:44:19,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:44:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-15 07:44:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:44:19,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863276671] [2022-04-15 07:44:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:44:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:44:19,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:44:19,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985265535] [2022-04-15 07:44:19,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:44:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:44:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:44:19,819 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:44:19,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 07:44:19,863 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:44:19,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:44:19,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 07:44:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:44:19,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:44:38,774 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:44:41,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {10131#true} call ULTIMATE.init(); {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {10131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10131#true} {10131#true} #69#return; {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {10131#true} call #t~ret8 := main(); {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {10131#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {10131#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:41,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10131#true} {10131#true} #61#return; {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {10131#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {10131#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10131#true} {10131#true} #63#return; {10131#true} is VALID [2022-04-15 07:44:41,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {10131#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:44:41,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:44:41,204 INFO L272 TraceCheckUtils]: 19: Hoare triple {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:41,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:41,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:41,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:41,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10131#true} {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:44:41,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:44:41,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {10187#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10212#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:44:41,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {10212#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:44:41,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10220#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:44:41,207 INFO L272 TraceCheckUtils]: 28: Hoare triple {10220#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:41,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {10131#true} ~cond := #in~cond; {10227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:41,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {10227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:41,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:41,229 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} {10220#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:44:41,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:44:41,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {10216#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10244#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1))} is VALID [2022-04-15 07:44:41,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {10244#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10248#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~x~0 2))} is VALID [2022-04-15 07:44:41,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {10248#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10252#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 2))} is VALID [2022-04-15 07:44:41,231 INFO L272 TraceCheckUtils]: 37: Hoare triple {10252#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:41,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {10131#true} ~cond := #in~cond; {10227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:41,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {10227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:41,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:41,233 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} {10252#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2))) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4))) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 2))} #65#return; {10268#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 2))) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:41,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {10268#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 2))) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {10268#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 2))) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-15 07:44:41,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {10268#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (<= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 2))) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10275#(and (= main_~y~0 2) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} is VALID [2022-04-15 07:44:41,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {10275#(and (= main_~y~0 2) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10279#(and (= main_~y~0 2) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} is VALID [2022-04-15 07:44:41,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {10279#(and (= main_~y~0 2) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10283#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~v~0) (* main_~X~0 (- 5))) (- 2))) main_~Y~0) main_~Y~0) main_~yx~0) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} is VALID [2022-04-15 07:44:41,241 INFO L272 TraceCheckUtils]: 46: Hoare triple {10283#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 8) (+ main_~v~0 (* 5 main_~X~0))) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~v~0) (* main_~X~0 (- 5))) (- 2))) main_~Y~0) main_~Y~0) main_~yx~0) (<= (* main_~Y~0 6) (+ main_~v~0 (* main_~X~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:44:41,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {10287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:41,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {10291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10132#false} is VALID [2022-04-15 07:44:41,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {10132#false} assume !false; {10132#false} is VALID [2022-04-15 07:44:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:44:41,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:44:43,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {10132#false} assume !false; {10132#false} is VALID [2022-04-15 07:44:43,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {10291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10132#false} is VALID [2022-04-15 07:44:43,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {10287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:44:43,889 INFO L272 TraceCheckUtils]: 46: Hoare triple {10307#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:44:43,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {10311#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10307#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:44:43,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {10315#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10311#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:44:43,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {10319#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10315#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:44:43,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {10319#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {10319#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:44:43,894 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} {10326#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {10319#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:44:43,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:43,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {10336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10231#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:44:43,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {10131#true} ~cond := #in~cond; {10336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:44:43,895 INFO L272 TraceCheckUtils]: 37: Hoare triple {10326#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {10131#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10326#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {10131#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {10131#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {10131#true} assume !!(~x~0 <= ~X~0); {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10131#true} {10131#true} #65#return; {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:43,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {10131#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {10131#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {10131#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {10131#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {10131#true} assume !!(~x~0 <= ~X~0); {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10131#true} {10131#true} #65#return; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {10131#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {10131#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {10131#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10131#true} {10131#true} #63#return; {10131#true} is VALID [2022-04-15 07:44:43,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {10131#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {10131#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10131#true} {10131#true} #61#return; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {10131#true} assume !(0 == ~cond); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {10131#true} ~cond := #in~cond; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {10131#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {10131#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {10131#true} call #t~ret8 := main(); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10131#true} {10131#true} #69#return; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {10131#true} assume true; {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {10131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10131#true} is VALID [2022-04-15 07:44:43,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {10131#true} call ULTIMATE.init(); {10131#true} is VALID [2022-04-15 07:44:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:44:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:44:43,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863276671] [2022-04-15 07:44:43,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:44:43,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985265535] [2022-04-15 07:44:43,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985265535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:44:43,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:44:43,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2022-04-15 07:44:43,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:44:43,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288489428] [2022-04-15 07:44:43,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288489428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:44:43,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:44:43,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:44:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673415027] [2022-04-15 07:44:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:44:43,900 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:43,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:44:43,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:43,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:43,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:44:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:44:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:44:43,944 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:46,664 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2022-04-15 07:44:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:44:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:44:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:44:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-15 07:44:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-15 07:44:46,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-04-15 07:44:46,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:46,733 INFO L225 Difference]: With dead ends: 122 [2022-04-15 07:44:46,733 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 07:44:46,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-04-15 07:44:46,734 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:44:46,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 242 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:44:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 07:44:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2022-04-15 07:44:47,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:44:47,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:44:47,027 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:44:47,027 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:44:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:47,029 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-04-15 07:44:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2022-04-15 07:44:47,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:47,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:47,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 120 states. [2022-04-15 07:44:47,030 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 120 states. [2022-04-15 07:44:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:44:47,032 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-04-15 07:44:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2022-04-15 07:44:47,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:44:47,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:44:47,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:44:47,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:44:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:44:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2022-04-15 07:44:47,034 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 50 [2022-04-15 07:44:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:44:47,034 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2022-04-15 07:44:47,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:44:47,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 131 transitions. [2022-04-15 07:44:47,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:44:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2022-04-15 07:44:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:44:47,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:44:47,378 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:44:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 07:44:47,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 07:44:47,578 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:44:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:44:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-15 07:44:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:44:47,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921466677] [2022-04-15 07:44:47,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:44:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-15 07:44:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:44:47,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049779313] [2022-04-15 07:44:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:44:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:44:47,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:44:47,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141348709] [2022-04-15 07:44:47,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:44:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:44:47,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:44:47,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:44:47,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 07:44:47,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:44:47,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:44:47,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 07:44:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:44:47,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:45:00,359 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:45:05,103 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:45:07,340 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:46:24,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #69#return; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret8 := main(); {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {11179#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {11179#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11179#true} {11179#true} #61#return; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {11179#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11179#true} is VALID [2022-04-15 07:46:24,636 INFO L272 TraceCheckUtils]: 12: Hoare triple {11179#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:24,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:24,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:24,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:24,637 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11179#true} {11179#true} #63#return; {11179#true} is VALID [2022-04-15 07:46:24,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {11179#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} is VALID [2022-04-15 07:46:24,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} is VALID [2022-04-15 07:46:24,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:24,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:24,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:24,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:24,638 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11179#true} {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} #65#return; {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} is VALID [2022-04-15 07:46:24,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} is VALID [2022-04-15 07:46:24,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {11235#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11260#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:46:24,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {11260#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11264#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:46:24,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {11264#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11268#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:46:24,641 INFO L272 TraceCheckUtils]: 28: Hoare triple {11268#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:24,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {11179#true} ~cond := #in~cond; {11275#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:24,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {11275#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:24,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:24,643 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} {11268#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} #65#return; {11286#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:46:24,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {11286#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {11290#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:46:24,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {11290#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11294#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4))) (not (< (* main_~Y~0 2) main_~X~0)))} is VALID [2022-04-15 07:46:24,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {11294#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4))) (not (< (* main_~Y~0 2) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11298#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4)) (* main_~Y~0 4)) (<= 2 main_~x~0) (<= 1 main_~X~0))} is VALID [2022-04-15 07:46:24,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {11298#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4)) (* main_~Y~0 4)) (<= 2 main_~x~0) (<= 1 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11302#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4)) (* main_~Y~0 4)) (<= 2 main_~x~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~X~0))} is VALID [2022-04-15 07:46:24,646 INFO L272 TraceCheckUtils]: 37: Hoare triple {11302#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4)) (* main_~Y~0 4)) (<= 2 main_~x~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:24,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {11179#true} ~cond := #in~cond; {11275#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:24,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {11275#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:24,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:24,648 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} {11302#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* (- 2) main_~X~0) (* main_~Y~0 4)) (* main_~Y~0 4)) (<= 2 main_~x~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~X~0))} #65#return; {11318#(and (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:46:24,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {11318#(and (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !!(~x~0 <= ~X~0); {11318#(and (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:46:24,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {11318#(and (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11325#(and (= (* main_~Y~0 6) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 4) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= 1 main_~X~0))} is VALID [2022-04-15 07:46:24,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {11325#(and (= (* main_~Y~0 6) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 4) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= 1 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11329#(and (= (+ (* main_~X~0 4) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= 1 main_~X~0))} is VALID [2022-04-15 07:46:24,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {11329#(and (= (+ (* main_~X~0 4) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (* (* main_~X~0 main_~y~0) 2) (* main_~X~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= 1 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11333#(and (= (mod (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* 2 (* (div (* main_~X~0 2) main_~X~0) main_~X~0)) (* main_~Y~0 6)) (+ (* main_~X~0 4) (* (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) 2))) (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (<= main_~X~0 (* main_~Y~0 2)) (= (mod (+ main_~X~0 main_~v~0 (* (div (* main_~X~0 2) main_~X~0) main_~X~0 2)) 2) 0) (<= 1 main_~X~0) (= (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0))} is VALID [2022-04-15 07:46:24,656 INFO L272 TraceCheckUtils]: 46: Hoare triple {11333#(and (= (mod (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* 2 (* (div (* main_~X~0 2) main_~X~0) main_~X~0)) (* main_~Y~0 6)) (+ (* main_~X~0 4) (* (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) 2))) (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (<= main_~X~0 (* main_~Y~0 2)) (= (mod (+ main_~X~0 main_~v~0 (* (div (* main_~X~0 2) main_~X~0) main_~X~0 2)) 2) 0) (<= 1 main_~X~0) (= (* (div (+ (div (+ main_~X~0 main_~v~0) 2) (* (div (* main_~X~0 2) main_~X~0) main_~X~0) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:24,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {11337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:24,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {11341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11180#false} is VALID [2022-04-15 07:46:24,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2022-04-15 07:46:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:46:24,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:46:33,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {11180#false} assume !false; {11180#false} is VALID [2022-04-15 07:46:33,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {11341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11180#false} is VALID [2022-04-15 07:46:33,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {11337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:46:33,450 INFO L272 TraceCheckUtils]: 46: Hoare triple {11357#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:46:33,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11357#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:46:33,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {11365#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:46:33,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11365#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:46:33,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:46:33,454 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} {11375#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {11361#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:46:33,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:33,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11279#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:46:33,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {11179#true} ~cond := #in~cond; {11385#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:46:33,455 INFO L272 TraceCheckUtils]: 37: Hoare triple {11375#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {11179#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11375#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {11179#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {11179#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {11179#true} assume !!(~x~0 <= ~X~0); {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11179#true} {11179#true} #65#return; {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:33,456 INFO L272 TraceCheckUtils]: 28: Hoare triple {11179#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {11179#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {11179#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {11179#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {11179#true} assume !!(~x~0 <= ~X~0); {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11179#true} {11179#true} #65#return; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {11179#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {11179#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {11179#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11179#true} {11179#true} #63#return; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:33,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L272 TraceCheckUtils]: 12: Hoare triple {11179#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {11179#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11179#true} {11179#true} #61#return; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {11179#true} assume !(0 == ~cond); {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {11179#true} ~cond := #in~cond; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {11179#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {11179#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {11179#true} call #t~ret8 := main(); {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11179#true} {11179#true} #69#return; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {11179#true} assume true; {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {11179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11179#true} is VALID [2022-04-15 07:46:33,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {11179#true} call ULTIMATE.init(); {11179#true} is VALID [2022-04-15 07:46:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:46:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:46:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049779313] [2022-04-15 07:46:33,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:46:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141348709] [2022-04-15 07:46:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141348709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:46:33,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:46:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 24 [2022-04-15 07:46:33,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:46:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921466677] [2022-04-15 07:46:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921466677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:46:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:46:33,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:46:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194526258] [2022-04-15 07:46:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:46:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:46:33,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:46:33,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:46:33,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:33,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:46:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:46:33,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:46:33,502 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:46:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:38,572 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-15 07:46:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:46:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:46:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:46:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:46:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:46:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:46:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:46:38,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-15 07:46:38,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:38,656 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:46:38,656 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:46:38,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:46:38,656 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:46:38,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 219 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 07:46:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:46:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-15 07:46:38,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:46:38,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:38,985 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:38,985 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:39,005 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:46:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:46:39,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:39,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:39,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:46:39,006 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:46:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:46:39,008 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:46:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:46:39,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:46:39,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:46:39,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:46:39,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:46:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:46:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:46:39,010 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-15 07:46:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:46:39,010 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:46:39,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:46:39,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:46:39,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:46:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:46:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:46:39,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:46:39,398 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:46:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 07:46:39,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 07:46:39,599 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:46:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:46:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-15 07:46:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:46:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456117709] [2022-04-15 07:46:39,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:46:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-15 07:46:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:46:39,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161743514] [2022-04-15 07:46:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:46:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:46:39,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:46:39,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164735067] [2022-04-15 07:46:39,618 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:46:39,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:46:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:46:39,622 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:46:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 07:46:39,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:46:39,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:46:39,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:46:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:46:39,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:46:54,660 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:03,484 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:10,398 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:15,156 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:19,219 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:27,334 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:47:31,962 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:51:11,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {12288#true} call ULTIMATE.init(); {12288#true} is VALID [2022-04-15 07:51:11,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {12288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12288#true} is VALID [2022-04-15 07:51:11,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12288#true} {12288#true} #69#return; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {12288#true} call #t~ret8 := main(); {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {12288#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {12288#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12288#true} {12288#true} #61#return; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {12288#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {12288#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:11,162 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12288#true} {12288#true} #63#return; {12288#true} is VALID [2022-04-15 07:51:11,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {12288#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:51:11,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:51:11,163 INFO L272 TraceCheckUtils]: 19: Hoare triple {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:11,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:11,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:11,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:11,164 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12288#true} {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:51:11,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {12344#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {12366#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:51:11,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {12366#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12370#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} is VALID [2022-04-15 07:51:11,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {12370#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} is VALID [2022-04-15 07:51:11,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} is VALID [2022-04-15 07:51:11,167 INFO L272 TraceCheckUtils]: 28: Hoare triple {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:11,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:11,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:11,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:11,167 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12288#true} {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} #65#return; {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} is VALID [2022-04-15 07:51:11,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} is VALID [2022-04-15 07:51:11,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {12374#(and (<= 1 main_~x~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~y~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12399#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= 1 main_~x~0) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 0 main_~X~0))} is VALID [2022-04-15 07:51:11,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {12399#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= 1 main_~x~0) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12403#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 2 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:51:11,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {12403#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 2 main_~x~0) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12407#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:51:11,170 INFO L272 TraceCheckUtils]: 37: Hoare triple {12407#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:11,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {12288#true} ~cond := #in~cond; {12414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:51:11,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {12414#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:51:11,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:51:11,172 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} {12407#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {12425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:51:11,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {12425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (not (< (* main_~Y~0 2) main_~X~0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {12429#(and (<= main_~x~0 main_~X~0) (<= main_~y~0 2) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:51:11,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {12429#(and (<= main_~x~0 main_~X~0) (<= main_~y~0 2) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 2 main_~x~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12433#(and (<= main_~x~0 main_~X~0) (<= main_~y~0 3) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (<= main_~X~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (= (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 6) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:51:11,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {12433#(and (<= main_~x~0 main_~X~0) (<= main_~y~0 3) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (<= main_~X~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (= (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 6) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12437#(and (<= main_~y~0 3) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~X~0 6) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (<= 3 main_~x~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:51:11,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {12437#(and (<= main_~y~0 3) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~X~0 6) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* main_~Y~0 6)) (<= 3 main_~x~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12441#(and (<= 3 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~X~0 6) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* main_~Y~0 6)) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= (div main_~xy~0 main_~X~0) 3) (<= (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) (+ main_~X~0 1)) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))} is VALID [2022-04-15 07:51:11,184 INFO L272 TraceCheckUtils]: 46: Hoare triple {12441#(and (<= 3 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (<= main_~X~0 (* main_~Y~0 2)) (= (+ (* main_~X~0 6) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* main_~Y~0 6)) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= (div main_~xy~0 main_~X~0) 3) (<= (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) (+ main_~X~0 1)) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:51:11,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {12445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:51:11,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {12449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12289#false} is VALID [2022-04-15 07:51:11,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {12289#false} assume !false; {12289#false} is VALID [2022-04-15 07:51:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 07:51:11,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:51:14,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {12289#false} assume !false; {12289#false} is VALID [2022-04-15 07:51:14,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {12449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12289#false} is VALID [2022-04-15 07:51:14,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {12445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:51:14,810 INFO L272 TraceCheckUtils]: 46: Hoare triple {12465#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:51:14,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {12469#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12465#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:51:14,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {12473#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12469#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:51:14,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {12469#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12473#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:51:14,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {12480#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {12469#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:51:14,817 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} {12484#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {12480#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:51:14,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:51:14,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {12494#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12418#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:51:14,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {12288#true} ~cond := #in~cond; {12494#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:51:14,818 INFO L272 TraceCheckUtils]: 37: Hoare triple {12484#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {12288#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12484#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {12288#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {12288#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {12288#true} assume !!(~x~0 <= ~X~0); {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12288#true} {12288#true} #65#return; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L272 TraceCheckUtils]: 28: Hoare triple {12288#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {12288#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12288#true} is VALID [2022-04-15 07:51:14,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {12288#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {12288#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {12288#true} assume !!(~x~0 <= ~X~0); {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12288#true} {12288#true} #65#return; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L272 TraceCheckUtils]: 19: Hoare triple {12288#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {12288#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {12288#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12288#true} {12288#true} #63#return; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:14,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {12288#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {12288#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12288#true} {12288#true} #61#return; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {12288#true} assume !(0 == ~cond); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {12288#true} ~cond := #in~cond; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {12288#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {12288#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {12288#true} call #t~ret8 := main(); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12288#true} {12288#true} #69#return; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {12288#true} assume true; {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {12288#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {12288#true} call ULTIMATE.init(); {12288#true} is VALID [2022-04-15 07:51:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 07:51:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:51:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161743514] [2022-04-15 07:51:14,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:51:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164735067] [2022-04-15 07:51:14,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164735067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:51:14,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:51:14,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2022-04-15 07:51:14,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:51:14,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456117709] [2022-04-15 07:51:14,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456117709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:51:14,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:51:14,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:51:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866669145] [2022-04-15 07:51:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:51:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:51:14,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:51:14,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:51:14,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:14,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:51:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:51:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:51:14,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:51:14,895 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:51:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:23,688 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-15 07:51:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:51:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-15 07:51:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:51:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:51:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:51:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:51:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:51:23,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-15 07:51:23,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:23,777 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:51:23,777 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:51:23,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:51:23,777 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:51:23,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 200 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 07:51:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:51:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-15 07:51:24,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:51:24,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:24,152 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:24,152 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:24,154 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:51:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:51:24,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:51:24,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:51:24,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:51:24,155 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-15 07:51:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:24,157 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-15 07:51:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-15 07:51:24,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:51:24,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:51:24,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:51:24,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:51:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:51:24,159 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-15 07:51:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:51:24,159 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:51:24,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:51:24,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:51:24,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:51:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:51:24,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:51:24,613 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:51:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 07:51:24,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 07:51:24,814 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:51:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:51:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-15 07:51:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:51:24,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962648623] [2022-04-15 07:51:24,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:51:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-15 07:51:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:51:24,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528099440] [2022-04-15 07:51:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:51:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:51:24,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:51:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665322630] [2022-04-15 07:51:24,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:51:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:51:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:51:24,830 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:51:24,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 07:51:24,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:51:24,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:51:24,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 07:51:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:51:24,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:51:25,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {13395#true} call ULTIMATE.init(); {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {13395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13395#true} {13395#true} #69#return; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {13395#true} call #t~ret8 := main(); {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {13395#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {13395#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13395#true} {13395#true} #61#return; {13395#true} is VALID [2022-04-15 07:51:25,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {13395#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13395#true} is VALID [2022-04-15 07:51:25,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {13395#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,895 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13395#true} {13395#true} #63#return; {13395#true} is VALID [2022-04-15 07:51:25,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {13395#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:51:25,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:51:25,898 INFO L272 TraceCheckUtils]: 19: Hoare triple {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13395#true} {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:51:25,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:51:25,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {13451#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13476#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 0))} is VALID [2022-04-15 07:51:25,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {13476#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} is VALID [2022-04-15 07:51:25,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} is VALID [2022-04-15 07:51:25,903 INFO L272 TraceCheckUtils]: 28: Hoare triple {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,904 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13395#true} {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} #65#return; {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} is VALID [2022-04-15 07:51:25,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} assume !!(~x~0 <= ~X~0); {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} is VALID [2022-04-15 07:51:25,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {13480#(and (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ main_~X~0 main_~v~0) 4) 1)) (<= main_~x~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13505#(and (<= main_~x~0 1) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} is VALID [2022-04-15 07:51:25,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {13505#(and (<= main_~x~0 1) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:51:25,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:51:25,906 INFO L272 TraceCheckUtils]: 37: Hoare triple {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,907 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13395#true} {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} #65#return; {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:51:25,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:51:25,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} is VALID [2022-04-15 07:51:25,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {13509#(and (< (div (+ (- 1) main_~X~0) (- 2)) 0) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} is VALID [2022-04-15 07:51:25,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} is VALID [2022-04-15 07:51:25,909 INFO L272 TraceCheckUtils]: 46: Hoare triple {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:25,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:25,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:25,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:25,910 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13395#true} {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} #65#return; {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} is VALID [2022-04-15 07:51:25,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {13537#(and (<= main_~x~0 3) (< (div (+ (- 1) main_~X~0) (- 2)) 0))} assume !(~x~0 <= ~X~0); {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {13396#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L272 TraceCheckUtils]: 53: Hoare triple {13396#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {13396#false} ~cond := #in~cond; {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {13396#false} assume 0 == ~cond; {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {13396#false} assume !false; {13396#false} is VALID [2022-04-15 07:51:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:51:25,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:51:26,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {13396#false} assume !false; {13396#false} is VALID [2022-04-15 07:51:26,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {13396#false} assume 0 == ~cond; {13396#false} is VALID [2022-04-15 07:51:26,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {13396#false} ~cond := #in~cond; {13396#false} is VALID [2022-04-15 07:51:26,247 INFO L272 TraceCheckUtils]: 53: Hoare triple {13396#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13396#false} is VALID [2022-04-15 07:51:26,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {13396#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13396#false} is VALID [2022-04-15 07:51:26,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {13589#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {13396#false} is VALID [2022-04-15 07:51:26,248 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13395#true} {13589#(<= main_~x~0 main_~X~0)} #65#return; {13589#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:51:26,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,249 INFO L272 TraceCheckUtils]: 46: Hoare triple {13589#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {13589#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13589#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:51:26,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {13611#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13589#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:51:26,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {13611#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13611#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:51:26,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {13611#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {13611#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:51:26,252 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13395#true} {13611#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {13611#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:51:26,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {13611#(<= (+ main_~x~0 1) main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {13611#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13611#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:51:26,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {13639#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13611#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:51:26,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13639#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-15 07:51:26,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:51:26,254 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13395#true} {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:51:26,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,254 INFO L272 TraceCheckUtils]: 28: Hoare triple {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:51:26,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {13668#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13643#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:51:26,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13668#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:51:26,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !!(~x~0 <= ~X~0); {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:51:26,258 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13395#true} {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:51:26,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,259 INFO L272 TraceCheckUtils]: 19: Hoare triple {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:51:26,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {13395#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13672#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-15 07:51:26,260 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13395#true} {13395#true} #63#return; {13395#true} is VALID [2022-04-15 07:51:26,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {13395#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {13395#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13395#true} {13395#true} #61#return; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {13395#true} assume !(0 == ~cond); {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {13395#true} ~cond := #in~cond; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {13395#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {13395#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {13395#true} call #t~ret8 := main(); {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13395#true} {13395#true} #69#return; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {13395#true} assume true; {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {13395#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13395#true} is VALID [2022-04-15 07:51:26,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {13395#true} call ULTIMATE.init(); {13395#true} is VALID [2022-04-15 07:51:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:51:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:51:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528099440] [2022-04-15 07:51:26,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:51:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665322630] [2022-04-15 07:51:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665322630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:51:26,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:51:26,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 07:51:26,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:51:26,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962648623] [2022-04-15 07:51:26,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962648623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:51:26,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:51:26,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:51:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939589970] [2022-04-15 07:51:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:51:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-15 07:51:26,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:51:26,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:51:26,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:26,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:51:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:51:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:51:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:51:26,294 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:51:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:26,876 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-15 07:51:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:51:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-15 07:51:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:51:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:51:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 07:51:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:51:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 07:51:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-15 07:51:26,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:26,965 INFO L225 Difference]: With dead ends: 133 [2022-04-15 07:51:26,965 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 07:51:26,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:51:26,966 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:51:26,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:51:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 07:51:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-04-15 07:51:27,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:51:27,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:27,195 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:27,195 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:27,196 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 07:51:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-15 07:51:27,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:51:27,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:51:27,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-15 07:51:27,197 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-15 07:51:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:51:27,199 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-15 07:51:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-15 07:51:27,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:51:27,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:51:27,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:51:27,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:51:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:51:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-15 07:51:27,201 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 57 [2022-04-15 07:51:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:51:27,201 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-15 07:51:27,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:51:27,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-15 07:51:27,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:51:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-15 07:51:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:51:27,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:51:27,611 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:51:27,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 07:51:27,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:51:27,812 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:51:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:51:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-15 07:51:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:51:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [352956561] [2022-04-15 07:51:27,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:51:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-15 07:51:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:51:27,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463787321] [2022-04-15 07:51:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:51:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:51:27,827 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:51:27,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993954695] [2022-04-15 07:51:27,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:51:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:51:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:51:27,834 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:51:27,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 07:51:27,885 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 07:51:27,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:51:27,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 07:51:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:51:27,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:51:42,674 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:51:48,401 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:51:54,422 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:52:02,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {14508#true} call ULTIMATE.init(); {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {14508#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14508#true} {14508#true} #69#return; {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {14508#true} call #t~ret8 := main(); {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {14508#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {14508#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14508#true} {14508#true} #61#return; {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {14508#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {14508#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14508#true} {14508#true} #63#return; {14508#true} is VALID [2022-04-15 07:52:02,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {14508#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:52:02,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:52:02,460 INFO L272 TraceCheckUtils]: 19: Hoare triple {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:02,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:02,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,460 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14508#true} {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 07:52:02,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {14564#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {14586#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-15 07:52:02,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {14586#(and (<= 0 main_~X~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,462 INFO L272 TraceCheckUtils]: 28: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:02,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:02,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,463 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14508#true} {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,464 INFO L272 TraceCheckUtils]: 37: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:02,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:02,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:02,465 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14508#true} {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {14590#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14642#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {14642#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14646#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:52:02,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {14646#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14650#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:52:02,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {14650#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14654#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:52:02,466 INFO L272 TraceCheckUtils]: 46: Hoare triple {14654#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:02,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {14508#true} ~cond := #in~cond; {14661#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:52:02,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {14661#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:52:02,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:52:02,468 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} {14654#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {14672#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:52:02,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {14672#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {14676#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:52:04,471 WARN L290 TraceCheckUtils]: 52: Hoare triple {14676#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14680#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} is UNKNOWN [2022-04-15 07:52:04,474 INFO L272 TraceCheckUtils]: 53: Hoare triple {14680#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14684#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:52:04,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {14684#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14688#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:52:04,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {14688#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14509#false} is VALID [2022-04-15 07:52:04,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {14509#false} assume !false; {14509#false} is VALID [2022-04-15 07:52:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-15 07:52:04,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:52:05,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {14509#false} assume !false; {14509#false} is VALID [2022-04-15 07:52:05,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {14688#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14509#false} is VALID [2022-04-15 07:52:05,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {14684#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14688#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:52:05,702 INFO L272 TraceCheckUtils]: 53: Hoare triple {14704#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14684#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:52:05,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {14708#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14704#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:52:05,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {14712#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {14708#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:52:05,705 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} {14716#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {14712#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:52:05,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:52:05,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {14726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14665#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:52:05,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {14508#true} ~cond := #in~cond; {14726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:52:05,706 INFO L272 TraceCheckUtils]: 46: Hoare triple {14716#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {14733#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14716#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:52:05,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {14737#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14733#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-15 07:52:05,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {14741#(forall ((main_~Y~0 Int) (v_main_~x~0_72 Int)) (or (= (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* 2 (* v_main_~x~0_72 (+ main_~y~0 1))) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_72 main_~X~0) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14737#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {14508#true} assume !!(~x~0 <= ~X~0); {14741#(forall ((main_~Y~0 Int) (v_main_~x~0_72 Int)) (or (= (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* 2 (* v_main_~x~0_72 (+ main_~y~0 1))) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_72 main_~X~0) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is VALID [2022-04-15 07:52:05,713 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14508#true} {14508#true} #65#return; {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L272 TraceCheckUtils]: 37: Hoare triple {14508#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {14508#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14508#true} is VALID [2022-04-15 07:52:05,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {14508#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {14508#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {14508#true} assume !!(~x~0 <= ~X~0); {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14508#true} {14508#true} #65#return; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L272 TraceCheckUtils]: 28: Hoare triple {14508#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {14508#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {14508#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {14508#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {14508#true} assume !!(~x~0 <= ~X~0); {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14508#true} {14508#true} #65#return; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:05,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {14508#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {14508#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {14508#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14508#true} {14508#true} #63#return; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L272 TraceCheckUtils]: 12: Hoare triple {14508#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {14508#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14508#true} {14508#true} #61#return; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {14508#true} assume !(0 == ~cond); {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {14508#true} ~cond := #in~cond; {14508#true} is VALID [2022-04-15 07:52:05,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {14508#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {14508#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {14508#true} call #t~ret8 := main(); {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14508#true} {14508#true} #69#return; {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {14508#true} assume true; {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {14508#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {14508#true} call ULTIMATE.init(); {14508#true} is VALID [2022-04-15 07:52:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:52:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:52:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463787321] [2022-04-15 07:52:05,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:52:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993954695] [2022-04-15 07:52:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993954695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:52:05,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:52:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-15 07:52:05,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:52:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [352956561] [2022-04-15 07:52:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [352956561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:52:05,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:52:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:52:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421090776] [2022-04-15 07:52:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:52:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:52:05,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:52:05,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:52:07,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:07,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:52:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:52:07,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2022-04-15 07:52:07,758 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:52:11,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:13,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:17,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:19,276 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:21,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:25,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:30,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:32,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:34,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:36,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:39,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:41,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:43,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:45,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:52:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:46,056 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-04-15 07:52:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:52:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:52:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:52:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:52:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 07:52:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:52:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 07:52:46,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-15 07:52:50,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 69 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:50,139 INFO L225 Difference]: With dead ends: 168 [2022-04-15 07:52:50,139 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 07:52:50,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=151, Invalid=840, Unknown=1, NotChecked=0, Total=992 [2022-04-15 07:52:50,140 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 9 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:52:50,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 252 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 494 Invalid, 12 Unknown, 0 Unchecked, 29.6s Time] [2022-04-15 07:52:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 07:52:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-04-15 07:52:50,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:52:50,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:52:50,691 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:52:50,691 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:52:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:50,693 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-15 07:52:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-15 07:52:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:52:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:52:50,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-15 07:52:50,694 INFO L87 Difference]: Start difference. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-15 07:52:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:50,696 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-15 07:52:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-15 07:52:50,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:52:50,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:52:50,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:52:50,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:52:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 07:52:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2022-04-15 07:52:50,699 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 57 [2022-04-15 07:52:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:52:50,699 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2022-04-15 07:52:50,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:52:50,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 184 transitions. [2022-04-15 07:52:51,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2022-04-15 07:52:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:52:51,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:52:51,255 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:52:51,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 07:52:51,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:52:51,456 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:52:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:52:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-15 07:52:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118347201] [2022-04-15 07:52:51,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:52:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-15 07:52:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:52:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638576876] [2022-04-15 07:52:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:52:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:52:51,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:52:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175192885] [2022-04-15 07:52:51,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:52:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:52:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:52:51,468 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:52:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 07:52:51,886 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 07:52:51,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:52:51,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 07:52:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:52:51,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:53:05,990 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:53:13,763 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:53:18,859 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:53:24,997 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (+ c_main_~X~0 1)) (.cse2 (+ (* (- 1) c_main_~Y~0) (div (+ c_main_~v~0 c_main_~X~0) 2) (* c_main_~X~0 c_main_~y~0))) (.cse0 (= c_main_~Y~0 0)) (.cse4 (= (mod (+ (* 2 c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2) 0))) (or (let ((.cse1 (div .cse2 c_main_~Y~0))) (and (not .cse0) (not (<= .cse1 c_main_~X~0)) (= (mod .cse2 c_main_~Y~0) 0) (= c_main_~xy~0 (* c_main_~y~0 .cse1)) (<= .cse1 .cse3) (= c_main_~yx~0 (* c_main_~Y~0 .cse1)) .cse4)) (and (let ((.cse6 (= c_main_~y~0 0))) (or (let ((.cse5 (div c_main_~xy~0 c_main_~y~0))) (and (<= .cse5 .cse3) (= (mod c_main_~xy~0 c_main_~y~0) 0) (not .cse6) (< c_main_~X~0 .cse5))) (and .cse6 (= c_main_~xy~0 0)))) (= 0 .cse2) .cse0 (= c_main_~yx~0 0) .cse4))) (<= 0 c_main_~X~0)) is different from false [2022-04-15 07:54:01,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {15855#true} call ULTIMATE.init(); {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {15855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15855#true} {15855#true} #69#return; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {15855#true} call #t~ret8 := main(); {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {15855#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {15855#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15855#true} {15855#true} #61#return; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {15855#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15855#true} is VALID [2022-04-15 07:54:01,449 INFO L272 TraceCheckUtils]: 12: Hoare triple {15855#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15855#true} {15855#true} #63#return; {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {15855#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15911#(<= 0 main_~x~0)} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {15911#(<= 0 main_~x~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15911#(<= 0 main_~x~0)} is VALID [2022-04-15 07:54:01,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {15911#(<= 0 main_~x~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:01,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:01,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15855#true} {15911#(<= 0 main_~x~0)} #65#return; {15911#(<= 0 main_~x~0)} is VALID [2022-04-15 07:54:01,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {15911#(<= 0 main_~x~0)} assume !!(~x~0 <= ~X~0); {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {15933#(<= 0 main_~X~0)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {15933#(<= 0 main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {15933#(<= 0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,453 INFO L272 TraceCheckUtils]: 28: Hoare triple {15933#(<= 0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:01,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:01,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,453 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15855#true} {15933#(<= 0 main_~X~0)} #65#return; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {15933#(<= 0 main_~X~0)} assume !!(~x~0 <= ~X~0); {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {15933#(<= 0 main_~X~0)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {15933#(<= 0 main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {15933#(<= 0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,454 INFO L272 TraceCheckUtils]: 37: Hoare triple {15933#(<= 0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:01,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:01,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:01,458 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15855#true} {15933#(<= 0 main_~X~0)} #65#return; {15933#(<= 0 main_~X~0)} is VALID [2022-04-15 07:54:01,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {15933#(<= 0 main_~X~0)} assume !!(~x~0 <= ~X~0); {15988#(and (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:54:01,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {15988#(and (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15988#(and (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-15 07:54:01,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {15988#(and (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15995#(and (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:54:01,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {15995#(and (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15999#(and (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:54:01,467 INFO L272 TraceCheckUtils]: 46: Hoare triple {15999#(and (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:01,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {15855#true} ~cond := #in~cond; {16006#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:01,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {16006#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:01,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:01,469 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} {15999#(and (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {16017#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:54:01,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {16017#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {16021#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:54:03,472 WARN L290 TraceCheckUtils]: 52: Hoare triple {16021#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16025#(and (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is UNKNOWN [2022-04-15 07:54:03,488 INFO L272 TraceCheckUtils]: 53: Hoare triple {16025#(and (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:03,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {16029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:03,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {16033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15856#false} is VALID [2022-04-15 07:54:03,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {15856#false} assume !false; {15856#false} is VALID [2022-04-15 07:54:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 07:54:03,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:54:04,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {15856#false} assume !false; {15856#false} is VALID [2022-04-15 07:54:04,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {16033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15856#false} is VALID [2022-04-15 07:54:04,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {16029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:04,509 INFO L272 TraceCheckUtils]: 53: Hoare triple {16049#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:04,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {16053#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16049#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:04,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {16057#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {16053#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:54:04,512 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} {16061#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {16057#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:54:04,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:04,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {16071#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:04,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {15855#true} ~cond := #in~cond; {16071#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:54:04,513 INFO L272 TraceCheckUtils]: 46: Hoare triple {16061#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {16078#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16061#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:54:04,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16078#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-15 07:54:04,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {16082#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16082#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-15 07:54:04,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {15855#true} assume !!(~x~0 <= ~X~0); {16082#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-15 07:54:04,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15855#true} {15855#true} #65#return; {15855#true} is VALID [2022-04-15 07:54:04,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:04,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L272 TraceCheckUtils]: 37: Hoare triple {15855#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {15855#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {15855#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {15855#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {15855#true} assume !!(~x~0 <= ~X~0); {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15855#true} {15855#true} #65#return; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L272 TraceCheckUtils]: 28: Hoare triple {15855#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {15855#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {15855#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {15855#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15855#true} is VALID [2022-04-15 07:54:04,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {15855#true} assume !!(~x~0 <= ~X~0); {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15855#true} {15855#true} #65#return; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L272 TraceCheckUtils]: 19: Hoare triple {15855#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {15855#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {15855#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15855#true} {15855#true} #63#return; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L272 TraceCheckUtils]: 12: Hoare triple {15855#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {15855#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15855#true} {15855#true} #61#return; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {15855#true} assume !(0 == ~cond); {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {15855#true} ~cond := #in~cond; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {15855#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {15855#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {15855#true} call #t~ret8 := main(); {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15855#true} {15855#true} #69#return; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {15855#true} assume true; {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {15855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {15855#true} call ULTIMATE.init(); {15855#true} is VALID [2022-04-15 07:54:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 07:54:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638576876] [2022-04-15 07:54:04,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175192885] [2022-04-15 07:54:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175192885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:54:04,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:54:04,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2022-04-15 07:54:04,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118347201] [2022-04-15 07:54:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118347201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:04,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:04,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:54:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663009569] [2022-04-15 07:54:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:54:04,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:04,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:54:06,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:06,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:54:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:54:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2022-04-15 07:54:06,587 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:54:09,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_main_~X~0 c_main_~y~0)) (.cse3 (+ c_main_~X~0 1))) (and (let ((.cse2 (+ (* (- 1) c_main_~Y~0) (div (+ c_main_~v~0 c_main_~X~0) 2) .cse7)) (.cse0 (= c_main_~Y~0 0)) (.cse4 (= (mod (+ (* 2 c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2) 0))) (or (let ((.cse1 (div .cse2 c_main_~Y~0))) (and (not .cse0) (not (<= .cse1 c_main_~X~0)) (= (mod .cse2 c_main_~Y~0) 0) (= c_main_~xy~0 (* c_main_~y~0 .cse1)) (<= .cse1 .cse3) (= c_main_~yx~0 (* c_main_~Y~0 .cse1)) .cse4)) (and (let ((.cse6 (= c_main_~y~0 0))) (or (let ((.cse5 (div c_main_~xy~0 c_main_~y~0))) (and (<= .cse5 .cse3) (= (mod c_main_~xy~0 c_main_~y~0) 0) (not .cse6) (< c_main_~X~0 .cse5))) (and .cse6 (= c_main_~xy~0 0)))) (= 0 .cse2) .cse0 (= c_main_~yx~0 0) .cse4))) (<= 0 c_main_~X~0) (not (<= c_main_~x~0 c_main_~X~0)) (= (+ (* 2 (* c_main_~Y~0 c_main_~x~0)) (* 2 c_main_~Y~0)) (+ (* 2 .cse7) c_main_~v~0 c_main_~X~0)) (<= c_main_~x~0 .cse3))) is different from false [2022-04-15 07:54:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:09,732 INFO L93 Difference]: Finished difference Result 163 states and 191 transitions. [2022-04-15 07:54:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:54:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-15 07:54:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:54:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 07:54:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:54:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 07:54:09,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-15 07:54:11,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:11,796 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:54:11,796 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 07:54:11,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=170, Invalid=648, Unknown=2, NotChecked=110, Total=930 [2022-04-15 07:54:11,797 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:11,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 136 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-04-15 07:54:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 07:54:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2022-04-15 07:54:12,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:12,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:12,142 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:12,142 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:12,144 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-15 07:54:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-15 07:54:12,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:12,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:12,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-15 07:54:12,145 INFO L87 Difference]: Start difference. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-15 07:54:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:12,146 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-15 07:54:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-15 07:54:12,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:12,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:12,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:12,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-15 07:54:12,148 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 57 [2022-04-15 07:54:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:12,149 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-15 07:54:12,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:54:12,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-15 07:54:12,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-15 07:54:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:54:12,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:12,529 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:12,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 07:54:12,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 07:54:12,730 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 7 times [2022-04-15 07:54:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:12,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430426374] [2022-04-15 07:54:12,730 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:54:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 8 times [2022-04-15 07:54:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:12,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182323199] [2022-04-15 07:54:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:12,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:12,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492157789] [2022-04-15 07:54:12,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:54:12,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:12,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:12,740 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:54:12,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 07:54:12,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:54:12,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:12,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:54:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:12,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:13,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {17107#true} call ULTIMATE.init(); {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {17107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17107#true} {17107#true} #69#return; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {17107#true} call #t~ret8 := main(); {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {17107#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {17107#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17107#true} {17107#true} #61#return; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {17107#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17107#true} is VALID [2022-04-15 07:54:13,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {17107#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {17107#true} ~cond := #in~cond; {17151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:54:13,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {17151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:54:13,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {17155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:54:13,449 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17155#(not (= |assume_abort_if_not_#in~cond| 0))} {17107#true} #63#return; {17162#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:54:13,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {17162#(and (<= main_~Y~0 50) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17107#true} {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {17166#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17191#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {17191#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,453 INFO L272 TraceCheckUtils]: 28: Hoare triple {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,453 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17107#true} {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {17195#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17220#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {17220#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:13,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:13,455 INFO L272 TraceCheckUtils]: 37: Hoare triple {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,456 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17107#true} {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} #65#return; {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:13,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:13,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {17224#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17249#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:13,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {17249#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,457 INFO L272 TraceCheckUtils]: 46: Hoare triple {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,458 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17107#true} {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:13,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {17253#(and (= main_~x~0 3) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17278#(and (= main_~x~0 3) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))))} is VALID [2022-04-15 07:54:13,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {17278#(and (= main_~x~0 3) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17282#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))) (= main_~x~0 4))} is VALID [2022-04-15 07:54:13,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {17282#(and (<= main_~Y~0 50) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))) (= main_~x~0 4))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17286#(and (= main_~xy~0 0) (= main_~yx~0 (* main_~Y~0 4)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))))} is VALID [2022-04-15 07:54:13,460 INFO L272 TraceCheckUtils]: 55: Hoare triple {17286#(and (= main_~xy~0 0) (= main_~yx~0 (* main_~Y~0 4)) (<= main_~Y~0 50) (<= 0 main_~Y~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 6))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:13,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {17290#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:13,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {17294#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17108#false} is VALID [2022-04-15 07:54:13,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {17108#false} assume !false; {17108#false} is VALID [2022-04-15 07:54:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 07:54:13,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:54:13,737 INFO L290 TraceCheckUtils]: 58: Hoare triple {17108#false} assume !false; {17108#false} is VALID [2022-04-15 07:54:13,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {17294#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17108#false} is VALID [2022-04-15 07:54:13,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {17290#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:13,738 INFO L272 TraceCheckUtils]: 55: Hoare triple {17310#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:13,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17310#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:54:13,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:13,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,742 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17107#true} {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,743 INFO L272 TraceCheckUtils]: 46: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:13,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,746 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17107#true} {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,746 INFO L272 TraceCheckUtils]: 37: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:13,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,749 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17107#true} {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,749 INFO L272 TraceCheckUtils]: 28: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17318#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:13,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,752 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17107#true} {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {17107#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17314#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:13,753 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17107#true} {17107#true} #63#return; {17107#true} is VALID [2022-04-15 07:54:13,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L272 TraceCheckUtils]: 12: Hoare triple {17107#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {17107#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17107#true} {17107#true} #61#return; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {17107#true} assume !(0 == ~cond); {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {17107#true} ~cond := #in~cond; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {17107#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {17107#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {17107#true} call #t~ret8 := main(); {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17107#true} {17107#true} #69#return; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {17107#true} assume true; {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {17107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17107#true} is VALID [2022-04-15 07:54:13,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {17107#true} call ULTIMATE.init(); {17107#true} is VALID [2022-04-15 07:54:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-15 07:54:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182323199] [2022-04-15 07:54:13,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492157789] [2022-04-15 07:54:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492157789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:54:13,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:54:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 20 [2022-04-15 07:54:13,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430426374] [2022-04-15 07:54:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430426374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:13,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:13,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:54:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641087204] [2022-04-15 07:54:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:54:13,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:13,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:13,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:13,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:54:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:54:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:54:13,790 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,300 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-04-15 07:54:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:54:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:54:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2022-04-15 07:54:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 66 transitions. [2022-04-15 07:54:15,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 66 transitions. [2022-04-15 07:54:15,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:15,356 INFO L225 Difference]: With dead ends: 130 [2022-04-15 07:54:15,356 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 07:54:15,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:54:15,357 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:15,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 206 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:54:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 07:54:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2022-04-15 07:54:15,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:15,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,578 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,578 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,580 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2022-04-15 07:54:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-04-15 07:54:15,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:15,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:15,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) Second operand 128 states. [2022-04-15 07:54:15,580 INFO L87 Difference]: Start difference. First operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) Second operand 128 states. [2022-04-15 07:54:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:15,582 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2022-04-15 07:54:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-04-15 07:54:15,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:15,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:15,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:15,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:54:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-04-15 07:54:15,584 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 59 [2022-04-15 07:54:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:15,584 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-04-15 07:54:15,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:15,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 132 transitions. [2022-04-15 07:54:15,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-04-15 07:54:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:54:15,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:15,988 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:15,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 07:54:16,188 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 07:54:16,188 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 15 times [2022-04-15 07:54:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:16,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670215059] [2022-04-15 07:54:16,189 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:54:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 16 times [2022-04-15 07:54:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:16,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123136636] [2022-04-15 07:54:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:16,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971356577] [2022-04-15 07:54:16,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:54:16,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:16,199 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:54:16,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 07:54:16,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:54:16,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:16,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 07:54:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:16,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:34,123 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:54:36,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {18240#true} call ULTIMATE.init(); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18240#true} {18240#true} #69#return; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {18240#true} call #t~ret8 := main(); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {18240#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {18240#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18240#true} {18240#true} #61#return; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {18240#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L272 TraceCheckUtils]: 12: Hoare triple {18240#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:36,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:36,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:36,747 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18240#true} {18240#true} #63#return; {18240#true} is VALID [2022-04-15 07:54:36,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {18240#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,748 INFO L272 TraceCheckUtils]: 19: Hoare triple {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:36,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:36,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:36,748 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18240#true} {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {18296#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18321#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {18321#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18329#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,750 INFO L272 TraceCheckUtils]: 28: Hoare triple {18329#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {18240#true} ~cond := #in~cond; {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:36,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,752 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} {18329#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {18325#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18353#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:36,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {18353#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:54:36,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:54:36,754 INFO L272 TraceCheckUtils]: 37: Hoare triple {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {18240#true} ~cond := #in~cond; {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:36,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,756 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} #65#return; {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:54:36,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {18357#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {18379#(and (<= main_~x~0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-15 07:54:36,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {18379#(and (<= main_~x~0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18383#(and (<= main_~x~0 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0) (= main_~x~0 2))} is VALID [2022-04-15 07:54:36,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {18383#(and (<= main_~x~0 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0) (= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18387#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 3) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {18387#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 3) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18391#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:54:36,757 INFO L272 TraceCheckUtils]: 46: Hoare triple {18391#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:36,758 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} ~cond := #in~cond; {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:36,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {18336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:36,760 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} {18391#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {18407#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 3) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {18407#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 3) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18407#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 3) (= main_~y~0 0))} is VALID [2022-04-15 07:54:36,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {18407#(and (<= 2 main_~X~0) (= (+ main_~v~0 (* main_~Y~0 (- 4))) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 3) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18414#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= main_~y~0 1) (<= 2 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:54:36,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {18414#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= main_~y~0 1) (<= 2 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18418#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= main_~y~0 1) (<= 2 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:36,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {18418#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= main_~y~0 1) (<= 2 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18422#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (<= 2 main_~X~0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-15 07:54:36,767 INFO L272 TraceCheckUtils]: 55: Hoare triple {18422#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (<= 2 main_~X~0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:36,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {18426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:36,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {18430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18241#false} is VALID [2022-04-15 07:54:36,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {18241#false} assume !false; {18241#false} is VALID [2022-04-15 07:54:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 07:54:36,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:54:39,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {18241#false} assume !false; {18241#false} is VALID [2022-04-15 07:54:39,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {18430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18241#false} is VALID [2022-04-15 07:54:39,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {18426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:39,181 INFO L272 TraceCheckUtils]: 55: Hoare triple {18446#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:39,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {18450#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18446#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:54:39,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {18454#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18450#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:39,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {18458#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18454#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:39,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {18458#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {18458#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:54:39,188 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} {18465#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {18458#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:54:39,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:39,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {18475#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:39,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} ~cond := #in~cond; {18475#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:54:39,189 INFO L272 TraceCheckUtils]: 46: Hoare triple {18465#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {18240#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18465#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {18240#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {18240#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {18240#true} assume !!(~x~0 <= ~X~0); {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18240#true} {18240#true} #65#return; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L272 TraceCheckUtils]: 37: Hoare triple {18240#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {18240#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {18240#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18240#true} is VALID [2022-04-15 07:54:39,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {18240#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {18240#true} assume !!(~x~0 <= ~X~0); {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18240#true} {18240#true} #65#return; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L272 TraceCheckUtils]: 28: Hoare triple {18240#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {18240#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {18240#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {18240#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {18240#true} assume !!(~x~0 <= ~X~0); {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18240#true} {18240#true} #65#return; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:39,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {18240#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {18240#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {18240#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18240#true} {18240#true} #63#return; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L272 TraceCheckUtils]: 12: Hoare triple {18240#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {18240#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18240#true} {18240#true} #61#return; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {18240#true} assume !(0 == ~cond); {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {18240#true} ~cond := #in~cond; {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {18240#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {18240#true} is VALID [2022-04-15 07:54:39,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {18240#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {18240#true} call #t~ret8 := main(); {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18240#true} {18240#true} #69#return; {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {18240#true} assume true; {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {18240#true} call ULTIMATE.init(); {18240#true} is VALID [2022-04-15 07:54:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:54:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:39,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123136636] [2022-04-15 07:54:39,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:39,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971356577] [2022-04-15 07:54:39,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971356577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:54:39,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:54:39,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 26 [2022-04-15 07:54:39,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:39,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670215059] [2022-04-15 07:54:39,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670215059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:39,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:39,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:54:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085121677] [2022-04-15 07:54:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:54:39,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:39,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:39,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:39,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 07:54:39,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 07:54:39,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:54:39,245 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:41,594 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-04-15 07:54:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:54:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:54:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:54:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:54:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-15 07:54:41,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2022-04-15 07:54:41,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:41,649 INFO L225 Difference]: With dead ends: 134 [2022-04-15 07:54:41,649 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:54:41,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:54:41,649 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:54:41,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 241 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:54:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:54:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-04-15 07:54:41,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:54:41,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:41,949 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:41,949 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:41,950 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-15 07:54:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:54:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:41,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:41,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-15 07:54:41,951 INFO L87 Difference]: Start difference. First operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-15 07:54:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:54:41,952 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-15 07:54:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-15 07:54:41,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:54:41,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:54:41,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:54:41,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:54:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.09375) internal successors, (105), 100 states have internal predecessors, (105), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:54:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-15 07:54:41,955 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 59 [2022-04-15 07:54:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:54:41,955 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-15 07:54:41,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:41,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-15 07:54:42,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-15 07:54:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:54:42,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:54:42,372 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:54:42,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 07:54:42,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:42,583 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:54:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:54:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 17 times [2022-04-15 07:54:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384923209] [2022-04-15 07:54:42,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:54:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 18 times [2022-04-15 07:54:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:54:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861051031] [2022-04-15 07:54:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:54:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:54:42,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:54:42,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273921708] [2022-04-15 07:54:42,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:54:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:54:42,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:54:42,612 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:54:42,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 07:54:42,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:54:42,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:54:42,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 07:54:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:54:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:54:50,633 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:54:53,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {19419#true} call ULTIMATE.init(); {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {19419#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19419#true} {19419#true} #69#return; {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {19419#true} call #t~ret8 := main(); {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {19419#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19419#true} is VALID [2022-04-15 07:54:53,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {19419#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19419#true} {19419#true} #61#return; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {19419#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L272 TraceCheckUtils]: 12: Hoare triple {19419#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:53,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19419#true} {19419#true} #63#return; {19419#true} is VALID [2022-04-15 07:54:53,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {19419#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:53,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:53,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:53,060 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19419#true} {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {19475#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,062 INFO L272 TraceCheckUtils]: 28: Hoare triple {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:53,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:53,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:53,063 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19419#true} {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #65#return; {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:54:53,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {19500#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19535#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,065 INFO L272 TraceCheckUtils]: 37: Hoare triple {19535#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {19419#true} ~cond := #in~cond; {19542#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:53,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {19542#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:53,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:53,066 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} {19535#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {19528#(and (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19559#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {19559#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19559#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-15 07:54:53,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {19559#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19566#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:54:53,068 INFO L272 TraceCheckUtils]: 46: Hoare triple {19566#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:53,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {19419#true} ~cond := #in~cond; {19542#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:53,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {19542#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:53,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:53,070 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} {19566#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {19582#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:54:53,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {19582#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {19582#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:54:53,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {19582#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19589#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 8) (* (- 2) main_~X~0))) (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} is VALID [2022-04-15 07:54:53,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {19589#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 8) (* (- 2) main_~X~0))) (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19593#(and (= main_~y~0 1) (= (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 8) (* (- 2) main_~X~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} is VALID [2022-04-15 07:54:53,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {19593#(and (= main_~y~0 1) (= (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 8) (* (- 2) main_~X~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19597#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-15 07:54:53,080 INFO L272 TraceCheckUtils]: 55: Hoare triple {19597#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 10)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:53,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {19601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:53,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {19605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19420#false} is VALID [2022-04-15 07:54:53,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {19420#false} assume !false; {19420#false} is VALID [2022-04-15 07:54:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:54:53,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:54:57,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {19420#false} assume !false; {19420#false} is VALID [2022-04-15 07:54:57,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {19605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19420#false} is VALID [2022-04-15 07:54:57,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {19601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:54:57,923 INFO L272 TraceCheckUtils]: 55: Hoare triple {19621#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:54:57,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19621#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:54:57,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {19629#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:57,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19629#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:54:57,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:57,934 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} {19639#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {19625#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:54:57,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:57,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {19649#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {19546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:54:57,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {19419#true} ~cond := #in~cond; {19649#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:54:57,935 INFO L272 TraceCheckUtils]: 46: Hoare triple {19639#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {19419#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19639#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:54:57,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {19419#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19419#true} is VALID [2022-04-15 07:54:57,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {19419#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19419#true} is VALID [2022-04-15 07:54:57,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {19419#true} assume !!(~x~0 <= ~X~0); {19419#true} is VALID [2022-04-15 07:54:57,936 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19419#true} {19419#true} #65#return; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L272 TraceCheckUtils]: 37: Hoare triple {19419#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {19419#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {19419#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {19419#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {19419#true} assume !!(~x~0 <= ~X~0); {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19419#true} {19419#true} #65#return; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L272 TraceCheckUtils]: 28: Hoare triple {19419#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {19419#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {19419#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {19419#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {19419#true} assume !!(~x~0 <= ~X~0); {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19419#true} {19419#true} #65#return; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L272 TraceCheckUtils]: 19: Hoare triple {19419#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {19419#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {19419#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19419#true} {19419#true} #63#return; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:57,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L272 TraceCheckUtils]: 12: Hoare triple {19419#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {19419#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19419#true} {19419#true} #61#return; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {19419#true} assume !(0 == ~cond); {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {19419#true} ~cond := #in~cond; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {19419#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {19419#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {19419#true} call #t~ret8 := main(); {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19419#true} {19419#true} #69#return; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {19419#true} assume true; {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {19419#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19419#true} is VALID [2022-04-15 07:54:57,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {19419#true} call ULTIMATE.init(); {19419#true} is VALID [2022-04-15 07:54:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:54:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:54:57,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861051031] [2022-04-15 07:54:57,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:54:57,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273921708] [2022-04-15 07:54:57,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273921708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:54:57,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:54:57,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-15 07:54:57,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:54:57,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384923209] [2022-04-15 07:54:57,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384923209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:54:57,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:54:57,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:54:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353238899] [2022-04-15 07:54:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:54:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:54:57,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:54:57,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:54:57,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:54:57,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:54:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:54:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:54:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:54:57,999 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:00,015 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-04-15 07:55:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:55:00,016 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:55:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:55:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 07:55:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 07:55:00,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-15 07:55:00,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:00,088 INFO L225 Difference]: With dead ends: 143 [2022-04-15 07:55:00,088 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 07:55:00,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:55:00,089 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:55:00,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:55:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 07:55:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2022-04-15 07:55:00,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:55:00,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:55:00,475 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:55:00,476 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:55:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:00,478 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-04-15 07:55:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-04-15 07:55:00,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:00,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:00,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) Second operand 141 states. [2022-04-15 07:55:00,478 INFO L87 Difference]: Start difference. First operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) Second operand 141 states. [2022-04-15 07:55:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:00,481 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-04-15 07:55:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-04-15 07:55:00,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:00,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:00,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:55:00,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:55:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 97 states have internal predecessors, (103), 18 states have call successors, (18), 15 states have call predecessors, (18), 14 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:55:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2022-04-15 07:55:00,483 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 59 [2022-04-15 07:55:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:55:00,483 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2022-04-15 07:55:00,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:00,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 138 transitions. [2022-04-15 07:55:00,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-04-15 07:55:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:55:00,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:55:00,909 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:55:00,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 07:55:01,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:55:01,109 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:55:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:55:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 19 times [2022-04-15 07:55:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:55:01,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510826844] [2022-04-15 07:55:01,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:55:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 20 times [2022-04-15 07:55:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:55:01,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182505171] [2022-04-15 07:55:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:55:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:55:01,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:55:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181176468] [2022-04-15 07:55:01,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:55:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:55:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:55:01,121 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:55:01,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 07:55:01,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:55:01,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:55:01,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 07:55:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:55:01,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:55:01,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {20623#true} call ULTIMATE.init(); {20623#true} is VALID [2022-04-15 07:55:01,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {20623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20623#true} is VALID [2022-04-15 07:55:01,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:01,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20623#true} {20623#true} #69#return; {20623#true} is VALID [2022-04-15 07:55:01,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {20623#true} call #t~ret8 := main(); {20623#true} is VALID [2022-04-15 07:55:01,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {20623#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {20623#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20623#true} {20623#true} #61#return; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {20623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L272 TraceCheckUtils]: 12: Hoare triple {20623#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:01,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20623#true} {20623#true} #63#return; {20623#true} is VALID [2022-04-15 07:55:01,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {20623#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,641 INFO L272 TraceCheckUtils]: 19: Hoare triple {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:01,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:01,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:01,642 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20623#true} {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {20679#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20704#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {20704#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,644 INFO L272 TraceCheckUtils]: 28: Hoare triple {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:01,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:01,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:01,645 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20623#true} {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #65#return; {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:55:01,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {20708#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20733#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:01,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {20733#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:01,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20741#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:55:01,647 INFO L272 TraceCheckUtils]: 37: Hoare triple {20741#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {20623#true} ~cond := #in~cond; {20748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:01,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {20748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:01,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:01,649 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} {20741#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:01,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:01,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {20737#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20765#(and (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:01,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {20765#(and (= (+ (- 2) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:01,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20773#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:55:01,651 INFO L272 TraceCheckUtils]: 46: Hoare triple {20773#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:01,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {20623#true} ~cond := #in~cond; {20748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:01,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {20748#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:01,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:01,652 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} {20773#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:01,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !!(~x~0 <= ~X~0); {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:01,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {20769#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20795#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} is VALID [2022-04-15 07:55:01,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {20795#(and (= (+ main_~x~0 (- 3)) 0) (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20799#(and (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0) (= (+ main_~x~0 (- 4)) 0))} is VALID [2022-04-15 07:55:01,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {20799#(and (= main_~y~0 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0) (= (+ main_~x~0 (- 4)) 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20803#(and (= main_~yx~0 (* main_~Y~0 4)) (= main_~X~0 main_~xy~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} is VALID [2022-04-15 07:55:01,655 INFO L272 TraceCheckUtils]: 55: Hoare triple {20803#(and (= main_~yx~0 (* main_~Y~0 4)) (= main_~X~0 main_~xy~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 10)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:55:01,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {20807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:01,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {20811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20624#false} is VALID [2022-04-15 07:55:01,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {20624#false} assume !false; {20624#false} is VALID [2022-04-15 07:55:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:55:01,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:55:04,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {20624#false} assume !false; {20624#false} is VALID [2022-04-15 07:55:04,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {20811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20624#false} is VALID [2022-04-15 07:55:04,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {20807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:04,473 INFO L272 TraceCheckUtils]: 55: Hoare triple {20827#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:55:04,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20827#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:55:04,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {20835#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:55:04,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20835#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:55:04,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:55:04,487 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} {20845#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {20831#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:55:04,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:04,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {20855#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:55:04,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {20623#true} ~cond := #in~cond; {20855#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:55:04,489 INFO L272 TraceCheckUtils]: 46: Hoare triple {20845#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {20623#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20845#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {20623#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {20623#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {20623#true} assume !!(~x~0 <= ~X~0); {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20623#true} {20623#true} #65#return; {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L272 TraceCheckUtils]: 37: Hoare triple {20623#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {20623#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {20623#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {20623#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {20623#true} assume !!(~x~0 <= ~X~0); {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20623#true} {20623#true} #65#return; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L272 TraceCheckUtils]: 28: Hoare triple {20623#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {20623#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {20623#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {20623#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {20623#true} assume !!(~x~0 <= ~X~0); {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20623#true} {20623#true} #65#return; {20623#true} is VALID [2022-04-15 07:55:04,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {20623#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {20623#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {20623#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20623#true} {20623#true} #63#return; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L272 TraceCheckUtils]: 12: Hoare triple {20623#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {20623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20623#true} {20623#true} #61#return; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-15 07:55:04,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {20623#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {20623#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {20623#true} call #t~ret8 := main(); {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20623#true} {20623#true} #69#return; {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {20623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {20623#true} call ULTIMATE.init(); {20623#true} is VALID [2022-04-15 07:55:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 07:55:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:55:04,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182505171] [2022-04-15 07:55:04,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:55:04,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181176468] [2022-04-15 07:55:04,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181176468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:55:04,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:55:04,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 23 [2022-04-15 07:55:04,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:55:04,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510826844] [2022-04-15 07:55:04,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510826844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:55:04,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:55:04,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:55:04,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495699860] [2022-04-15 07:55:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:55:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:55:04,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:55:04,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:04,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:04,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:55:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:55:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:55:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:55:04,557 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:06,533 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-04-15 07:55:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:55:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:55:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:55:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:55:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-15 07:55:06,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-15 07:55:06,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:06,613 INFO L225 Difference]: With dead ends: 156 [2022-04-15 07:55:06,613 INFO L226 Difference]: Without dead ends: 154 [2022-04-15 07:55:06,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:55:06,613 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:55:06,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 213 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:55:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-15 07:55:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2022-04-15 07:55:06,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:55:06,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:55:06,898 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:55:06,899 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:55:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:06,901 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-04-15 07:55:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2022-04-15 07:55:06,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:06,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:06,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) Second operand 154 states. [2022-04-15 07:55:06,901 INFO L87 Difference]: Start difference. First operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) Second operand 154 states. [2022-04-15 07:55:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:06,904 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-04-15 07:55:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2022-04-15 07:55:06,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:06,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:06,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:55:06,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:55:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 108 states have (on average 1.0925925925925926) internal successors, (118), 111 states have internal predecessors, (118), 20 states have call successors, (20), 17 states have call predecessors, (20), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:55:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2022-04-15 07:55:06,907 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 59 [2022-04-15 07:55:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:55:06,908 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2022-04-15 07:55:06,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:06,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 157 transitions. [2022-04-15 07:55:07,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2022-04-15 07:55:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:55:07,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:55:07,400 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:55:07,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 07:55:07,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 07:55:07,600 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:55:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:55:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 21 times [2022-04-15 07:55:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:55:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335108454] [2022-04-15 07:55:07,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:55:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 22 times [2022-04-15 07:55:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:55:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944779219] [2022-04-15 07:55:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:55:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:55:07,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:55:07,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711792379] [2022-04-15 07:55:07,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:55:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:55:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:55:07,613 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:55:07,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 07:55:07,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:55:07,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:55:07,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 07:55:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:55:07,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:55:08,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {21915#true} call ULTIMATE.init(); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {21915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21915#true} {21915#true} #69#return; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {21915#true} call #t~ret8 := main(); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {21915#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {21915#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21915#true} {21915#true} #61#return; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {21915#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {21915#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,200 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21915#true} {21915#true} #63#return; {21915#true} is VALID [2022-04-15 07:55:08,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {21915#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:08,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:08,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,201 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21915#true} {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:08,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:55:08,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {21971#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21996#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:55:08,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {21996#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:55:08,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:55:08,204 INFO L272 TraceCheckUtils]: 28: Hoare triple {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,205 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21915#true} {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:55:08,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:55:08,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {22000#(and (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22025#(and (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 07:55:08,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {22025#(and (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:08,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:08,207 INFO L272 TraceCheckUtils]: 37: Hoare triple {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,208 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21915#true} {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} #65#return; {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:08,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-15 07:55:08,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {22029#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22054#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:08,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {22054#(and (= (+ (- 1) main_~x~0) 1) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:08,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:08,210 INFO L272 TraceCheckUtils]: 46: Hoare triple {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,211 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21915#true} {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #65#return; {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:08,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !!(~x~0 <= ~X~0); {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-15 07:55:08,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {22058#(and (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22083#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))))} is VALID [2022-04-15 07:55:08,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {22083#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= main_~x~0 3) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22087#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))) (= main_~x~0 4))} is VALID [2022-04-15 07:55:08,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {22087#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))) (= main_~x~0 4))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22091#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))) (= main_~yx~0 (* main_~Y~0 4)))} is VALID [2022-04-15 07:55:08,214 INFO L272 TraceCheckUtils]: 55: Hoare triple {22091#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (not (< (* main_~Y~0 8) (* main_~X~0 3))) (= main_~yx~0 (* main_~Y~0 4)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:55:08,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {22095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:08,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {22099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21916#false} is VALID [2022-04-15 07:55:08,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {21916#false} assume !false; {21916#false} is VALID [2022-04-15 07:55:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:55:08,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:55:08,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {21916#false} assume !false; {21916#false} is VALID [2022-04-15 07:55:08,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {22099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21916#false} is VALID [2022-04-15 07:55:08,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {22095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:55:08,888 INFO L272 TraceCheckUtils]: 55: Hoare triple {22115#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:55:08,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {22119#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22115#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:55:08,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {22123#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22119#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:55:08,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22123#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:55:08,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:55:08,894 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21915#true} {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:55:08,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,894 INFO L272 TraceCheckUtils]: 46: Hoare triple {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:55:08,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {22152#(or (< main_~v~0 0) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22127#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:55:08,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22152#(or (< main_~v~0 0) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} is VALID [2022-04-15 07:55:08,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !!(~x~0 <= ~X~0); {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:55:08,898 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21915#true} {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #65#return; {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:55:08,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,898 INFO L272 TraceCheckUtils]: 37: Hoare triple {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:55:08,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {22181#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22156#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-15 07:55:08,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22181#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) 0))} is VALID [2022-04-15 07:55:08,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} assume !!(~x~0 <= ~X~0); {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} is VALID [2022-04-15 07:55:08,903 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21915#true} {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} #65#return; {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} is VALID [2022-04-15 07:55:08,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,904 INFO L272 TraceCheckUtils]: 28: Hoare triple {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} is VALID [2022-04-15 07:55:08,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {22210#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22185#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))))} is VALID [2022-04-15 07:55:08,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22210#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 6)) (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2))))} is VALID [2022-04-15 07:55:08,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} assume !!(~x~0 <= ~X~0); {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} is VALID [2022-04-15 07:55:08,908 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21915#true} {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} #65#return; {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} is VALID [2022-04-15 07:55:08,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,908 INFO L272 TraceCheckUtils]: 19: Hoare triple {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} is VALID [2022-04-15 07:55:08,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {21915#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22214#(or (not (< main_~v~0 0)) (< (+ main_~v~0 (* main_~Y~0 6)) (* main_~X~0 2)) (= (+ (* (* (+ main_~x~0 4) main_~Y~0) 2) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0)))} is VALID [2022-04-15 07:55:08,909 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21915#true} {21915#true} #63#return; {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L272 TraceCheckUtils]: 12: Hoare triple {21915#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 50 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {21915#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {21915#true} is VALID [2022-04-15 07:55:08,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21915#true} {21915#true} #61#return; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {21915#true} assume !(0 == ~cond); {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {21915#true} ~cond := #in~cond; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {21915#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 50 then 1 else 0)); {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {21915#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {21915#true} call #t~ret8 := main(); {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21915#true} {21915#true} #69#return; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {21915#true} assume true; {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {21915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {21915#true} call ULTIMATE.init(); {21915#true} is VALID [2022-04-15 07:55:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 07:55:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:55:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944779219] [2022-04-15 07:55:08,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:55:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711792379] [2022-04-15 07:55:08,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711792379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:55:08,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:55:08,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 07:55:08,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:55:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335108454] [2022-04-15 07:55:08,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335108454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:55:08,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:55:08,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:55:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311525466] [2022-04-15 07:55:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:55:08,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:55:08,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:55:08,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:08,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:08,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:55:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:55:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:55:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:55:08,959 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:10,505 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-04-15 07:55:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:55:10,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-15 07:55:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:55:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 07:55:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 07:55:10,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-15 07:55:10,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:10,572 INFO L225 Difference]: With dead ends: 156 [2022-04-15 07:55:10,572 INFO L226 Difference]: Without dead ends: 154 [2022-04-15 07:55:10,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:55:10,573 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:55:10,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 247 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:55:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-15 07:55:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2022-04-15 07:55:11,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:55:11,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:55:11,004 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:55:11,004 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:55:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:11,006 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-04-15 07:55:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-04-15 07:55:11,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:11,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:11,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 154 states. [2022-04-15 07:55:11,007 INFO L87 Difference]: Start difference. First operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 154 states. [2022-04-15 07:55:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:55:11,009 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2022-04-15 07:55:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-04-15 07:55:11,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:55:11,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:55:11,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:55:11,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:55:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 104 states have internal predecessors, (110), 19 states have call successors, (19), 16 states have call predecessors, (19), 15 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 07:55:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-04-15 07:55:11,011 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 59 [2022-04-15 07:55:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:55:11,011 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-04-15 07:55:11,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 07:55:11,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 147 transitions. [2022-04-15 07:55:11,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:55:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-04-15 07:55:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 07:55:11,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:55:11,518 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:55:11,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 07:55:11,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 07:55:11,718 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:55:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:55:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 23 times [2022-04-15 07:55:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:55:11,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [503209402] [2022-04-15 07:55:11,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:55:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 24 times [2022-04-15 07:55:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:55:11,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565169435] [2022-04-15 07:55:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:55:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:55:11,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:55:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867291637] [2022-04-15 07:55:11,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:55:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:55:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:55:11,730 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:55:11,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 07:55:11,778 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:55:11,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:55:11,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 07:55:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:55:11,792 INFO L286 TraceCheckSpWp]: Computing forward predicates...