/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:03:02,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:03:02,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:03:02,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:03:02,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:03:02,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:03:02,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:03:02,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:03:02,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:03:02,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:03:02,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:03:02,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:03:02,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:03:02,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:03:02,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:03:02,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:03:02,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:03:02,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:03:02,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:03:02,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:03:02,632 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:03:02,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:03:02,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:03:02,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:03:02,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:03:02,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:03:02,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:03:02,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:03:02,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:03:02,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:03:02,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:03:02,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:03:02,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:03:02,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:03:02,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:03:02,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:03:02,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:03:02,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:03:02,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:03:02,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:03:02,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:03:02,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:03:02,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:03:02,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:03:02,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:03:02,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:03:02,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:03:02,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:03:02,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:03:02,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:03:02,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:03:02,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:03:02,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:03:02,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:03:02,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:03:02,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:03:02,665 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:03:02,665 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-08 11:03:02,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:03:02,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:03:02,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:03:02,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:03:02,880 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:03:02,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-08 11:03:02,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179316226/6c17aecb653944d8ac21e72f52b828f0/FLAGc70e83168 [2022-04-08 11:03:03,330 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:03:03,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-08 11:03:03,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179316226/6c17aecb653944d8ac21e72f52b828f0/FLAGc70e83168 [2022-04-08 11:03:03,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179316226/6c17aecb653944d8ac21e72f52b828f0 [2022-04-08 11:03:03,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:03:03,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:03:03,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:03:03,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:03:03,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:03:03,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17114dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03, skipping insertion in model container [2022-04-08 11:03:03,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:03:03,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:03:03,564 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_valuebound10.c[597,610] [2022-04-08 11:03:03,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:03:03,590 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:03:03,602 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_valuebound10.c[597,610] [2022-04-08 11:03:03,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:03:03,622 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:03:03,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03 WrapperNode [2022-04-08 11:03:03,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:03:03,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:03:03,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:03:03,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:03:03,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:03:03,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:03:03,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:03:03,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:03:03,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (1/1) ... [2022-04-08 11:03:03,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:03:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:03,695 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-08 11:03:03,699 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-08 11:03:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:03:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:03:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:03:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:03:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:03:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:03:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:03:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:03:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:03:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:03:03,770 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:03:03,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:03:03,917 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:03:03,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:03:03,922 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:03:03,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:03:03 BoogieIcfgContainer [2022-04-08 11:03:03,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:03:03,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:03:03,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:03:03,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:03:03,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:03:03" (1/3) ... [2022-04-08 11:03:03,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc39dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:03:03, skipping insertion in model container [2022-04-08 11:03:03,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:03:03" (2/3) ... [2022-04-08 11:03:03,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc39dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:03:03, skipping insertion in model container [2022-04-08 11:03:03,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:03:03" (3/3) ... [2022-04-08 11:03:03,948 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound10.c [2022-04-08 11:03:03,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:03:03,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:03:03,981 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:03:03,985 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-08 11:03:03,986 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:03:03,998 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-08 11:03:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:03:04,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:04,003 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-08 11:03:04,004 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-08 11:03:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:04,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986379559] [2022-04-08 11:03:04,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-08 11:03:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:04,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440682100] [2022-04-08 11:03:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:03:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:04,193 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-08 11:03:04,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 11:03:04,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 11:03:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:03:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:04,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:03:04,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:03:04,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:03:04,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 11:03:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 11:03:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:04,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:03:04,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:03:04,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:03:04,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 11:03:04,234 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-08 11:03:04,234 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-08 11:03:04,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 11:03:04,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 11:03:04,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-08 11:03:04,235 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-08 11:03:04,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-08 11:03:04,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:03:04,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:03:04,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:03:04,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 11:03:04,238 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-08 11:03:04,238 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-08 11:03:04,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:03:04,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:03:04,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:03:04,240 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 11:03:04,240 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-08 11:03:04,240 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-08 11:03:04,240 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-08 11:03:04,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 11:03:04,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 11:03:04,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 11:03:04,241 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-08 11:03:04,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:04,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440682100] [2022-04-08 11:03:04,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440682100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:04,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:04,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:03:04,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:04,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986379559] [2022-04-08 11:03:04,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986379559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:04,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:04,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:03:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923046979] [2022-04-08 11:03:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:04,250 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-08 11:03:04,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:04,258 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-08 11:03:04,302 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-08 11:03:04,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:03:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:03:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:03:04,329 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-08 11:03:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:04,477 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-08 11:03:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:03:04,477 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-08 11:03:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:04,478 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-08 11:03:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 11:03:04,485 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-08 11:03:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 11:03:04,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-08 11:03:04,561 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-08 11:03:04,567 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:03:04,567 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:03:04,569 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-08 11:03:04,571 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-08 11:03:04,571 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-08 11:03:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:03:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 11:03:04,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:04,612 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-08 11:03:04,613 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-08 11:03:04,613 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-08 11:03:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:04,616 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 11:03:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:03:04,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:04,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:04,617 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-08 11:03:04,618 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-08 11:03:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:04,620 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 11:03:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:03:04,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:04,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:04,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:04,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:04,621 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-08 11:03:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 11:03:04,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-08 11:03:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:04,624 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 11:03:04,625 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-08 11:03:04,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 11:03:04,651 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-08 11:03:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:03:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:03:04,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:04,652 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-08 11:03:04,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:03:04,652 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-08 11:03:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581978055] [2022-04-08 11:03:04,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-08 11:03:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:04,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489397788] [2022-04-08 11:03:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:04,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521717916] [2022-04-08 11:03:04,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:03:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:04,696 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-08 11:03:04,697 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-08 11:03:04,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:03:04,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:04,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:03:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:04,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:04,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-08 11:03:04,919 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-08 11:03:04,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:03:04,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-08 11:03:04,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-08 11:03:04,919 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-08 11:03:04,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-08 11:03:04,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 11:03:04,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 11:03:04,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:03:04,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-08 11:03:04,920 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-08 11:03:04,920 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-08 11:03:04,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 11:03:04,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 11:03:04,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:03:04,921 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-08 11:03:04,922 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-08 11:03:04,922 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-08 11:03:04,923 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-08 11:03:04,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:04,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-08 11:03:04,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-08 11:03:04,933 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-08 11:03:04,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:03:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:04,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489397788] [2022-04-08 11:03:04,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:04,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521717916] [2022-04-08 11:03:04,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521717916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:04,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:04,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:03:04,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:04,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581978055] [2022-04-08 11:03:04,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581978055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:04,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:04,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:03:04,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69383151] [2022-04-08 11:03:04,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:04,935 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-08 11:03:04,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:04,936 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-08 11:03:04,952 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-08 11:03:04,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:03:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:03:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:03:04,954 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-08 11:03:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:05,138 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 11:03:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:03:05,139 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-08 11:03:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:05,140 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-08 11:03:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:03:05,151 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-08 11:03:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:03:05,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 11:03:05,186 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-08 11:03:05,190 INFO L225 Difference]: With dead ends: 39 [2022-04-08 11:03:05,190 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:03:05,192 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-08 11:03:05,194 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:03:05,197 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.0s Time] [2022-04-08 11:03:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:03:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 11:03:05,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:05,211 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-08 11:03:05,211 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-08 11:03:05,214 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-08 11:03:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:05,216 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:03:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:03:05,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:05,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:05,218 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-08 11:03:05,218 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-08 11:03:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:05,227 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:03:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:03:05,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:05,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:05,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:05,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:05,230 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-08 11:03:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 11:03:05,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-08 11:03:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:05,232 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 11:03:05,232 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-08 11:03:05,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 11:03:05,261 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-08 11:03:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 11:03:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 11:03:05,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:05,263 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-08 11:03:05,285 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-08 11:03:05,475 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-08 11:03:05,476 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-08 11:03:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:05,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2047064124] [2022-04-08 11:03:05,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-08 11:03:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:05,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145978259] [2022-04-08 11:03:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:05,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:05,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866799939] [2022-04-08 11:03:05,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:03:05,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:05,503 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-08 11:03:05,507 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-08 11:03:05,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:03:05,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:05,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 11:03:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:05,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:05,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 11:03:05,902 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-08 11:03:05,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:05,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 11:03:05,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 11:03:05,902 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-08 11:03:05,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-08 11:03:05,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:03:05,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:03:05,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:05,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 11:03:05,904 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-08 11:03:05,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-08 11:03:05,904 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-08 11:03:05,905 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-08 11:03:05,905 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-08 11:03:05,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {615#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #63#return; {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~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) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} 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) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} 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-08 11:03:05,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:03:05,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:03:05,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:05,909 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) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {655#(and (= 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))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (= 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))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= 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))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:05,914 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= 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))) (<= main_~Y~0 10))} 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-08 11:03:05,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:05,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 11:03:05,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 11:03:05,916 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-08 11:03:05,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:03:06,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 11:03:06,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 11:03:06,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:06,143 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-08 11:03:06,144 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-08 11:03:06,145 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-08 11:03:06,154 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-08 11:03:06,155 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-08 11:03:06,155 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-08 11:03:06,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:06,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:03:06,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:03:06,156 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-08 11:03:06,156 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-08 11:03:06,159 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-08 11:03:06,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-08 11:03:06,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:06,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:03:06,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:03:06,160 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-08 11:03:06,160 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-08 11:03:06,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 11:03:06,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:06,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:03:06,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:03:06,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-08 11:03:06,161 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-08 11:03:06,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 11:03:06,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 11:03:06,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:03:06,161 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-08 11:03:06,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 11:03:06,162 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-08 11:03:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:06,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145978259] [2022-04-08 11:03:06,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:06,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866799939] [2022-04-08 11:03:06,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866799939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:03:06,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:03:06,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-08 11:03:06,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2047064124] [2022-04-08 11:03:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2047064124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:06,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:06,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:03:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980956856] [2022-04-08 11:03:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:06,163 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-08 11:03:06,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:06,164 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-08 11:03:06,188 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-08 11:03:06,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:03:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:03:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:03:06,189 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-08 11:03:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:06,757 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 11:03:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:03:06,757 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-08 11:03:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:06,758 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-08 11:03:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 11:03:06,760 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-08 11:03:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 11:03:06,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-08 11:03:06,805 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-08 11:03:06,807 INFO L225 Difference]: With dead ends: 48 [2022-04-08 11:03:06,807 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 11:03:06,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:03:06,808 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-08 11:03:06,808 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-08 11:03:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 11:03:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 11:03:06,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:06,840 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-08 11:03:06,840 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-08 11:03:06,840 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-08 11:03:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:06,842 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 11:03:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 11:03:06,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:06,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:06,842 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-08 11:03:06,843 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-08 11:03:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:06,860 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 11:03:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 11:03:06,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:06,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:06,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:06,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:06,861 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-08 11:03:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 11:03:06,863 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-08 11:03:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:06,863 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 11:03:06,863 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-08 11:03:06,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 11:03:06,908 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-08 11:03:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 11:03:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 11:03:06,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:06,910 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-08 11:03:06,936 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-08 11:03:07,135 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-08 11:03:07,136 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-08 11:03:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696578874] [2022-04-08 11:03:07,137 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-08 11:03:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885815821] [2022-04-08 11:03:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:07,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:07,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455587533] [2022-04-08 11:03:07,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:03:07,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:07,170 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-08 11:03:07,172 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-08 11:03:07,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:03:07,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:07,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 11:03:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:07,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:07,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 11:03:07,412 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-08 11:03:07,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 11:03:07,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 11:03:07,412 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-08 11:03:07,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:03:07,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 11:03:07,413 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-08 11:03:07,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,413 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 11:03:07,414 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-08 11:03:07,414 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-08 11:03:07,415 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-08 11:03:07,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,416 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-08 11:03:07,416 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-08 11:03:07,417 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-08 11:03:07,417 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-08 11:03:07,418 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-08 11:03:07,419 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-08 11:03:07,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:07,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 11:03:07,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 11:03:07,420 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-08 11:03:07,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:03:07,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 11:03:07,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 11:03:07,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:07,601 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-08 11:03:07,602 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-08 11:03:07,650 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-08 11:03:07,652 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-08 11:03:07,652 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-08 11:03:07,653 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-08 11:03:07,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,654 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-08 11:03:07,654 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-08 11:03:07,655 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-08 11:03:07,655 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 11:03:07,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,655 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:03:07,655 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-08 11:03:07,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:03:07,656 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-08 11:03:07,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 11:03:07,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:03:07,656 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-08 11:03:07,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 11:03:07,657 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-08 11:03:07,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:07,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885815821] [2022-04-08 11:03:07,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:07,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455587533] [2022-04-08 11:03:07,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455587533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:03:07,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:03:07,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-08 11:03:07,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:07,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696578874] [2022-04-08 11:03:07,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696578874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:07,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:07,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:03:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255272794] [2022-04-08 11:03:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:07,658 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-08 11:03:07,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:07,659 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-08 11:03:07,680 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-08 11:03:07,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:03:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:03:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:03:07,681 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-08 11:03:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:08,038 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 11:03:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:03:08,039 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-08 11:03:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:08,039 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-08 11:03:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 11:03:08,040 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-08 11:03:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 11:03:08,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-08 11:03:08,094 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-08 11:03:08,095 INFO L225 Difference]: With dead ends: 56 [2022-04-08 11:03:08,095 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 11:03:08,096 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-08 11:03:08,096 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-08 11:03:08,097 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-08 11:03:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 11:03:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-08 11:03:08,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:08,132 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-08 11:03:08,132 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-08 11:03:08,133 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-08 11:03:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:08,134 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 11:03:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 11:03:08,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:08,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:08,135 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-08 11:03:08,135 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-08 11:03:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:08,137 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 11:03:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 11:03:08,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:08,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:08,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:08,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:08,138 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-08 11:03:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-08 11:03:08,139 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-08 11:03:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:08,139 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-08 11:03:08,140 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-08 11:03:08,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-08 11:03:08,191 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-08 11:03:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 11:03:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 11:03:08,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:08,192 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-08 11:03:08,211 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-08 11:03:08,407 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-08 11:03:08,408 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-08 11:03:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:08,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241420380] [2022-04-08 11:03:08,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-08 11:03:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:08,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145250889] [2022-04-08 11:03:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:08,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:08,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966355533] [2022-04-08 11:03:08,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:03:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:08,427 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-08 11:03:08,428 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-08 11:03:08,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:03:08,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:08,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 11:03:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:08,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:21,403 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:03:28,436 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:03:30,615 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:03:36,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 11:03:36,230 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-08 11:03:36,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:36,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 11:03:36,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 11:03:36,230 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-08 11:03:36,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:03:36,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 11:03:36,231 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-08 11:03:36,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:36,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 11:03:36,235 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-08 11:03:36,235 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-08 11:03:36,235 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-08 11:03:36,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:36,236 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-08 11:03:36,236 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-08 11:03:36,237 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-08 11:03:36,237 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-08 11:03:36,238 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-08 11:03:36,238 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-08 11:03:36,239 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-08 11:03:36,239 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-08 11:03:36,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:36,239 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-08 11:03:36,240 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-08 11:03:36,241 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_~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)) (<= 0 main_~X~0))} is VALID [2022-04-08 11:03:36,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(and (= (+ (- 1) main_~y~0) 0) (<= 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)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1688#(and (= (+ (- 1) main_~y~0) 0) (<= 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)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:03:36,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(and (= (+ (- 1) main_~y~0) 0) (<= 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)) (<= 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 (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< 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))) (<= (div main_~xy~0 main_~y~0) 1) (= 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) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (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 VALID [2022-04-08 11:03:36,251 INFO L272 TraceCheckUtils]: 35: Hoare triple {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< 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))) (<= (div main_~xy~0 main_~y~0) 1) (= 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) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (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)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:03:36,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:36,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 11:03:36,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 11:03:36,252 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-08 11:03:36,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:03:48,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 11:03:48,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 11:03:48,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:48,520 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-08 11:03:48,521 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-08 11:03:48,522 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-08 11:03:48,523 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-08 11:03:48,524 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-08 11:03:48,524 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-08 11:03:48,524 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-08 11:03:48,525 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-08 11:03:48,525 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-08 11:03:48,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} #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-08 11:03:48,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~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; {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} is VALID [2022-04-08 11:03:48,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#true} assume !!(~x~0 <= ~X~0); {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} is VALID [2022-04-08 11:03:48,531 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-08 11:03:48,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:48,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:03:48,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:03:48,532 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-08 11:03:48,532 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-08 11:03:48,532 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-08 11:03:48,532 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 11:03:48,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:48,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:03:48,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:03:48,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:03:48,532 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-08 11:03:48,533 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:03:48,533 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-08 11:03:48,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 11:03:48,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:03:48,533 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-08 11:03:48,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 11:03:48,534 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-08 11:03:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145250889] [2022-04-08 11:03:48,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966355533] [2022-04-08 11:03:48,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966355533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:03:48,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:03:48,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-08 11:03:48,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241420380] [2022-04-08 11:03:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241420380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:48,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:03:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538388998] [2022-04-08 11:03:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:48,535 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-08 11:03:48,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:48,536 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-08 11:03:48,580 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-08 11:03:48,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:03:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:03:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:03:48,581 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-08 11:03:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:53,353 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 11:03:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:03:53,353 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-08 11:03:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:03:53,354 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-08 11:03:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 11:03:53,356 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-08 11:03:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 11:03:53,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-08 11:03:53,410 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-08 11:03:53,411 INFO L225 Difference]: With dead ends: 61 [2022-04-08 11:03:53,411 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 11:03:53,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:03:53,412 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:03:53,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:03:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 11:03:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-08 11:03:53,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:03:53,447 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-08 11:03:53,447 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-08 11:03:53,447 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-08 11:03:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:53,449 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 11:03:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 11:03:53,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:53,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:53,449 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-08 11:03:53,450 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-08 11:03:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:03:53,451 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 11:03:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 11:03:53,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:03:53,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:03:53,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:03:53,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:03:53,452 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-08 11:03:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 11:03:53,453 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-08 11:03:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:03:53,453 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 11:03:53,453 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-08 11:03:53,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 11:03:53,508 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-08 11:03:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 11:03:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:03:53,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:03:53,509 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-08 11:03:53,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 11:03:53,719 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-08 11:03:53,719 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:03:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:03:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-08 11:03:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818168341] [2022-04-08 11:03:53,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:03:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-08 11:03:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:03:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255495236] [2022-04-08 11:03:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:03:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:03:53,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:03:53,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977874921] [2022-04-08 11:03:53,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:03:53,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:03:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:03:53,742 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-08 11:03:53,743 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-08 11:03:53,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:03:53,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:03:53,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 11:03:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:03:53,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:03:54,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 11:03:54,494 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-08 11:03:54,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:54,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 11:03:54,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 11:03:54,494 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-08 11:03:54,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:03:54,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:03:54,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:03:54,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:03:54,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2155#true} #61#return; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:03:54,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:03:54,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:03:54,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:03:54,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:03:54,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:03:54,498 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} is VALID [2022-04-08 11:03:54,500 INFO L272 TraceCheckUtils]: 19: Hoare triple {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~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)); {2155#true} is VALID [2022-04-08 11:03:54,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:54,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:03:54,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:03:54,502 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} #65#return; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,505 INFO L272 TraceCheckUtils]: 28: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} 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-08 11:03:54,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:03:54,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:03:54,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:54,506 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:03:54,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-08 11:03:54,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-08 11:03:54,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-08 11:03:54,510 INFO L272 TraceCheckUtils]: 37: Hoare triple {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~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)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:03:54,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:54,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 11:03:54,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 11:03:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 11:03:54,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:03:59,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 11:03:59,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 11:03:59,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:03:59,628 INFO L272 TraceCheckUtils]: 37: Hoare triple {2304#(= (+ (* 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)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:03:59,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {2308#(= (+ (* 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; {2304#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:03:59,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {2312#(= (+ (* (* 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; {2308#(= (+ (* 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-08 11:03:59,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {2316#(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; {2312#(= (+ (* (* 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-08 11:03:59,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {2316#(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); {2316#(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-08 11:03:59,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2316#(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)))))} #65#return; {2316#(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-08 11:03:59,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:59,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:03:59,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:03:59,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {2316#(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)))))} 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-08 11:03:59,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2316#(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-08 11:03:59,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2316#(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-08 11:03:59,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {2345#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:03:59,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2345#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume !!(~x~0 <= ~X~0); {2345#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-08 11:03:59,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2352#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2345#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-08 11:03:59,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:03:59,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:03:59,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:03:59,637 INFO L272 TraceCheckUtils]: 19: Hoare triple {2352#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 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-08 11:03:59,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {2369#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2352#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:03:59,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2369#(or (= (+ (* (* main_~X~0 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:03:59,639 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-08 11:03:59,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:59,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:03:59,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:03:59,639 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:03:59,639 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-08 11:03:59,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-08 11:03:59,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:59,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:03:59,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:03:59,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:03:59,640 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-08 11:03:59,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 11:03:59,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 11:03:59,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:03:59,641 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-08 11:03:59,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 11:03:59,641 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-08 11:03:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:03:59,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255495236] [2022-04-08 11:03:59,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:03:59,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977874921] [2022-04-08 11:03:59,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977874921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:03:59,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:03:59,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2022-04-08 11:03:59,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:03:59,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818168341] [2022-04-08 11:03:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818168341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:03:59,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:03:59,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 11:03:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384469484] [2022-04-08 11:03:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:03:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 11:03:59,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:03:59,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:03:59,677 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-08 11:03:59,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 11:03:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:03:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 11:03:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:03:59,679 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:04:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:00,695 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-08 11:04:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 11:04:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 11:04:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:04:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-08 11:04:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:04:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-08 11:04:00,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 58 transitions. [2022-04-08 11:04:00,758 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-08 11:04:00,759 INFO L225 Difference]: With dead ends: 61 [2022-04-08 11:04:00,759 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 11:04:00,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-04-08 11:04:00,760 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:04:00,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 146 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:04:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 11:04:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-08 11:04:00,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:00,844 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-08 11:04:00,844 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-08 11:04:00,844 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-08 11:04:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:00,845 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 11:04:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 11:04:00,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:00,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:00,846 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-08 11:04:00,846 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-08 11:04:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:00,847 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 11:04:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 11:04:00,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:00,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:00,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:00,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:00,848 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-08 11:04:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-04-08 11:04:00,849 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 41 [2022-04-08 11:04:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:00,850 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-04-08 11:04:00,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:04:00,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 61 transitions. [2022-04-08 11:04:00,920 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-08 11:04:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-08 11:04:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:04:00,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:00,921 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-08 11:04:00,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 11:04:01,121 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-08 11:04:01,122 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-08 11:04:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178222828] [2022-04-08 11:04:01,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-08 11:04:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204483787] [2022-04-08 11:04:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:01,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:01,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720999078] [2022-04-08 11:04:01,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:04:01,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:01,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:01,135 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-08 11:04:01,142 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-08 11:04:01,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:04:01,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:01,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 11:04:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:01,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#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; {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:01,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-08 11:04:01,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:01,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {2836#(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; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:01,491 INFO L272 TraceCheckUtils]: 19: Hoare triple {2836#(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)); {2780#true} is VALID [2022-04-08 11:04:01,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:01,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:01,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:01,492 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:01,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {2836#(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); {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:01,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {2836#(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; {2861#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:04:01,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {2861#(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; {2865#(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-08 11:04:01,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {2865#(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; {2869#(and (= (+ (- 1) main_~x~0) 0) (= 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-08 11:04:01,495 INFO L272 TraceCheckUtils]: 28: Hoare triple {2869#(and (= (+ (- 1) main_~x~0) 0) (= 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)); {2780#true} is VALID [2022-04-08 11:04:01,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:01,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:01,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:01,498 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2869#(and (= (+ (- 1) main_~x~0) 0) (= 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; {2865#(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-08 11:04:01,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {2865#(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); {2865#(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-08 11:04:01,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#(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; {2893#(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-08 11:04:01,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {2893#(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; {2897#(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 2))} is VALID [2022-04-08 11:04:01,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {2897#(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 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2901#(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-08 11:04:01,501 INFO L272 TraceCheckUtils]: 37: Hoare triple {2901#(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)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:01,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:01,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-08 11:04:01,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-08 11:04:01,505 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-08 11:04:01,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:07,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-08 11:04:07,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-08 11:04:07,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:07,882 INFO L272 TraceCheckUtils]: 37: Hoare triple {2925#(= (+ (* 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)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:07,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#(= (+ (* 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; {2925#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:04:07,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {2933#(= (+ (* (* 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; {2929#(= (+ (* 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-08 11:04:07,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#(= (+ (* 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; {2933#(= (+ (* (* 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-08 11:04:07,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {2929#(= (+ (* 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); {2929#(= (+ (* 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-08 11:04:07,887 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2943#(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; {2929#(= (+ (* 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-08 11:04:07,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:07,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:07,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:04:07,889 INFO L272 TraceCheckUtils]: 28: Hoare triple {2943#(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)); {2780#true} is VALID [2022-04-08 11:04:07,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2943#(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-08 11:04:07,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2780#true} is VALID [2022-04-08 11:04:07,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#true} assume !!(~x~0 <= ~X~0); {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2780#true} #65#return; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L272 TraceCheckUtils]: 19: Hoare triple {2780#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:07,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#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; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2780#true} is VALID [2022-04-08 11:04:07,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-08 11:04:07,892 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-08 11:04:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204483787] [2022-04-08 11:04:07,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720999078] [2022-04-08 11:04:07,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720999078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:04:07,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:04:07,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 11:04:07,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178222828] [2022-04-08 11:04:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178222828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:07,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:07,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 11:04:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501011704] [2022-04-08 11:04:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:07,893 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-08 11:04:07,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:07,894 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-08 11:04:07,922 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-08 11:04:07,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 11:04:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 11:04:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:04:07,923 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-08 11:04:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:08,935 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-08 11:04:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 11:04:08,935 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-08 11:04:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:08,936 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-08 11:04:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 11:04:08,937 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-08 11:04:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 11:04:08,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-08 11:04:08,991 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-08 11:04:08,992 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:04:08,992 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 11:04:08,992 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-08 11:04:08,993 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:04:08,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:04:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 11:04:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-04-08 11:04:09,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:09,076 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-08 11:04:09,076 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-08 11:04:09,076 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-08 11:04:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:09,078 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-08 11:04:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-08 11:04:09,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:09,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:09,078 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-08 11:04:09,078 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-08 11:04:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:09,080 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-08 11:04:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-08 11:04:09,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:09,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:09,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:09,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:09,080 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-08 11:04:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-08 11:04:09,082 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 41 [2022-04-08 11:04:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:09,082 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-08 11:04:09,082 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-08 11:04:09,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-08 11:04:09,179 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-08 11:04:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-08 11:04:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:04:09,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:09,179 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-08 11:04:09,196 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-08 11:04:09,383 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-08 11:04:09,384 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-08 11:04:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:09,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421206416] [2022-04-08 11:04:09,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-08 11:04:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:09,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943683709] [2022-04-08 11:04:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:09,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352355146] [2022-04-08 11:04:09,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:04:09,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:09,396 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-08 11:04:09,397 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-08 11:04:09,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:04:09,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:09,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 11:04:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:09,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:28,370 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:04:34,422 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:04:40,510 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:04:40,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-08 11:04:40,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#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; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-08 11:04:40,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:40,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:40,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:40,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-08 11:04:40,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:04:40,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#(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; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:04:40,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {3507#(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)); {3451#true} is VALID [2022-04-08 11:04:40,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:40,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:40,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:40,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:04:40,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:04:40,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {3507#(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; {3532#(and (= 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))))} is VALID [2022-04-08 11:04:40,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {3532#(and (= 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))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3536#(and (= (+ (- 1) 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))))} is VALID [2022-04-08 11:04:40,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#(and (= (+ (- 1) 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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3540#(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)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:40,858 INFO L272 TraceCheckUtils]: 28: Hoare triple {3540#(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)) (= (+ (* (- 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)); {3451#true} is VALID [2022-04-08 11:04:40,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:40,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:40,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:40,860 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3540#(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)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {3558#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:40,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {3558#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {3558#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:40,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {3558#(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))) (= (+ (* (- 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; {3565#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} is VALID [2022-04-08 11:04:40,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {3565#(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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= 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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 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)))} is VALID [2022-04-08 11:04:40,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= 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))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 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)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0)))} is VALID [2022-04-08 11:04:40,864 INFO L272 TraceCheckUtils]: 37: Hoare triple {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) 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)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:40,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:40,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-08 11:04:40,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-08 11:04:40,865 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-08 11:04:40,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:44,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-08 11:04:44,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-08 11:04:44,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:44,304 INFO L272 TraceCheckUtils]: 37: Hoare triple {3597#(= (+ (* 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)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:44,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {3601#(= (+ (* 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; {3597#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:04:44,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#(= (+ (* (* 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; {3601#(= (+ (* 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-08 11:04:44,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {3609#(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; {3605#(= (+ (* (* 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-08 11:04:44,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {3609#(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); {3609#(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-08 11:04:44,308 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3616#(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; {3609#(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-08 11:04:44,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:44,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:44,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:04:44,309 INFO L272 TraceCheckUtils]: 28: Hoare triple {3616#(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)); {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3616#(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-08 11:04:44,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {3451#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {3451#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; {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {3451#true} assume !!(~x~0 <= ~X~0); {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3451#true} #65#return; {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L272 TraceCheckUtils]: 19: Hoare triple {3451#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-08 11:04:44,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-08 11:04:44,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#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; {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3451#true} is VALID [2022-04-08 11:04:44,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-08 11:04:44,312 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-08 11:04:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943683709] [2022-04-08 11:04:44,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352355146] [2022-04-08 11:04:44,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352355146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:04:44,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:04:44,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-08 11:04:44,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421206416] [2022-04-08 11:04:44,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421206416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:44,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:44,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:04:44,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533539085] [2022-04-08 11:04:44,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:44,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:44,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:44,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:44,349 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-08 11:04:44,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:04:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:04:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:04:44,350 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:45,639 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-04-08 11:04:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:04:45,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 11:04:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 11:04:45,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-08 11:04:45,717 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-08 11:04:45,718 INFO L225 Difference]: With dead ends: 86 [2022-04-08 11:04:45,718 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 11:04:45,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:04:45,719 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:04:45,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 184 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:04:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 11:04:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-08 11:04:45,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:45,838 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-08 11:04:45,838 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-08 11:04:45,838 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-08 11:04:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:45,840 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-08 11:04:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 11:04:45,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:45,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:45,840 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-08 11:04:45,841 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-08 11:04:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:45,842 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-08 11:04:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 11:04:45,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:45,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:45,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:45,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:45,843 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-08 11:04:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-08 11:04:45,844 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-08 11:04:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:45,845 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-08 11:04:45,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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-08 11:04:45,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-08 11:04:45,961 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-08 11:04:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 11:04:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:04:45,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:45,962 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-08 11:04:45,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 11:04:46,178 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-08 11:04:46,178 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-08 11:04:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1536744314] [2022-04-08 11:04:46,179 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-08 11:04:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038243553] [2022-04-08 11:04:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:46,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:46,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232481710] [2022-04-08 11:04:46,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:04:46,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:46,194 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-08 11:04:46,203 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-08 11:04:46,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:04:46,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:46,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 11:04:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:46,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:46,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#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; {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:46,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:46,579 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-08 11:04:46,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:46,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {4244#(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; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:46,581 INFO L272 TraceCheckUtils]: 19: Hoare triple {4244#(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)); {4188#true} is VALID [2022-04-08 11:04:46,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:46,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:46,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:46,582 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:46,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {4244#(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); {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:46,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {4244#(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; {4269#(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-08 11:04:46,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {4269#(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; {4273#(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-08 11:04:46,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {4273#(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; {4273#(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-08 11:04:46,584 INFO L272 TraceCheckUtils]: 28: Hoare triple {4273#(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))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-08 11:04:46,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:46,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:46,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:46,585 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4273#(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))))} #65#return; {4273#(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-08 11:04:46,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {4273#(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); {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 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-08 11:04:46,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 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 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} is VALID [2022-04-08 11:04:46,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:04:46,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} is VALID [2022-04-08 11:04:46,589 INFO L272 TraceCheckUtils]: 37: Hoare triple {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~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)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:46,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:46,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-08 11:04:46,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-08 11:04:46,590 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-08 11:04:46,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:47,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-08 11:04:47,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-08 11:04:47,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:47,004 INFO L272 TraceCheckUtils]: 37: Hoare triple {4331#(= (+ (* 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)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:47,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {4335#(= (+ (* 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; {4331#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:04:47,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {4339#(= (+ (* (* 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; {4335#(= (+ (* 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-08 11:04:47,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {4335#(= (+ (* 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; {4339#(= (+ (* (* 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-08 11:04:47,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {4346#(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); {4335#(= (+ (* 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-08 11:04:47,009 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4346#(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; {4346#(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-08 11:04:47,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:47,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:47,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:47,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {4346#(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)); {4188#true} is VALID [2022-04-08 11:04:47,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(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; {4346#(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-08 11:04:47,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* 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; {4346#(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-08 11:04:47,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {4372#(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 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; {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* 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-08 11:04:47,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(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 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {4372#(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 1) main_~X~0)))} is VALID [2022-04-08 11:04:47,014 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4372#(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 1) main_~X~0)))} #65#return; {4372#(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 1) main_~X~0)))} is VALID [2022-04-08 11:04:47,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:47,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:47,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:47,014 INFO L272 TraceCheckUtils]: 19: Hoare triple {4372#(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 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)); {4188#true} is VALID [2022-04-08 11:04:47,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(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 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4372#(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 1) main_~X~0)))} is VALID [2022-04-08 11:04:47,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4372#(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 1) main_~X~0)))} is VALID [2022-04-08 11:04:47,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-08 11:04:47,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#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; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-08 11:04:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 11:04:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038243553] [2022-04-08 11:04:47,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232481710] [2022-04-08 11:04:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232481710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:04:47,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:04:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-08 11:04:47,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1536744314] [2022-04-08 11:04:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1536744314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:47,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:04:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99598177] [2022-04-08 11:04:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:47,018 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-08 11:04:47,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:47,018 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-08 11:04:47,051 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-08 11:04:47,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:04:47,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:04:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:04:47,052 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-08 11:04:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:47,779 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-04-08 11:04:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:04:47,780 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-08 11:04:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:47,780 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-08 11:04:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 11:04:47,781 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-08 11:04:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 11:04:47,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 11:04:47,829 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-08 11:04:47,831 INFO L225 Difference]: With dead ends: 86 [2022-04-08 11:04:47,831 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 11:04:47,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-08 11:04:47,832 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-08 11:04:47,832 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-08 11:04:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 11:04:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-04-08 11:04:47,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:47,942 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-08 11:04:47,942 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-08 11:04:47,942 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-08 11:04:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:47,944 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-08 11:04:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-08 11:04:47,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:47,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:47,944 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-08 11:04:47,945 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-08 11:04:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:47,946 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-08 11:04:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-08 11:04:47,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:47,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:47,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:47,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:47,947 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-08 11:04:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-08 11:04:47,948 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-08 11:04:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:47,948 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-08 11:04:47,949 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-08 11:04:47,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-08 11:04:48,088 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-08 11:04:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 11:04:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 11:04:48,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:48,089 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-08 11:04:48,140 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-08 11:04:48,295 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-08 11:04:48,295 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 1 times [2022-04-08 11:04:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892724138] [2022-04-08 11:04:48,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 2 times [2022-04-08 11:04:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:48,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222223739] [2022-04-08 11:04:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:48,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:48,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339770172] [2022-04-08 11:04:48,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:04:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:48,325 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-08 11:04:48,328 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-08 11:04:48,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:04:48,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 11:04:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:48,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:49,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#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; {4940#true} is VALID [2022-04-08 11:04:49,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-08 11:04:49,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:04:49,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {4996#(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; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:04:49,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {4996#(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)); {4940#true} is VALID [2022-04-08 11:04:49,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,097 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:04:49,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:04:49,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {4996#(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; {5021#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:04:49,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {5021#(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; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:04:49,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {5025#(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; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:04:49,100 INFO L272 TraceCheckUtils]: 28: Hoare triple {5025#(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)); {4940#true} is VALID [2022-04-08 11:04:49,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,101 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:04:49,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:04:49,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {5025#(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; {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:04:49,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:04:49,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {5054#(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; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:04:49,103 INFO L272 TraceCheckUtils]: 37: Hoare triple {5054#(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)); {4940#true} is VALID [2022-04-08 11:04:49,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,104 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:04:49,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-08 11:04:49,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-08 11:04:49,105 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#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)); {4941#false} is VALID [2022-04-08 11:04:49,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-08 11:04:49,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-08 11:04:49,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-08 11:04:49,105 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-08 11:04:49,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:49,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-08 11:04:49,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-08 11:04:49,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-08 11:04:49,387 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#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)); {4941#false} is VALID [2022-04-08 11:04:49,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-08 11:04:49,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-08 11:04:49,388 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5106#(<= main_~x~0 main_~X~0)} #65#return; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:04:49,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,389 INFO L272 TraceCheckUtils]: 37: Hoare triple {5106#(<= 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)); {4940#true} is VALID [2022-04-08 11:04:49,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:04:49,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {5128#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:04:49,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {5132#(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; {5128#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:04:49,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:04:49,404 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:04:49,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,405 INFO L272 TraceCheckUtils]: 28: Hoare triple {5132#(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)); {4940#true} is VALID [2022-04-08 11:04:49,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {5132#(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; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:04:49,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:04:49,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {5161#(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; {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:04:49,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {5161#(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); {5161#(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-08 11:04:49,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #65#return; {5161#(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-08 11:04:49,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,407 INFO L272 TraceCheckUtils]: 19: Hoare triple {5161#(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)); {4940#true} is VALID [2022-04-08 11:04:49,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {5161#(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; {5161#(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-08 11:04:49,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5161#(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-08 11:04:49,409 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-08 11:04:49,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#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; {4940#true} is VALID [2022-04-08 11:04:49,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-08 11:04:49,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-08 11:04:49,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-08 11:04:49,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4940#true} is VALID [2022-04-08 11:04:49,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-08 11:04:49,410 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-08 11:04:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222223739] [2022-04-08 11:04:49,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339770172] [2022-04-08 11:04:49,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339770172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:04:49,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:04:49,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:04:49,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:49,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892724138] [2022-04-08 11:04:49,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892724138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:49,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:49,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:04:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879366775] [2022-04-08 11:04:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:49,412 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-08 11:04:49,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:49,412 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-08 11:04:49,443 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-08 11:04:49,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:04:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:04:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:04:49,444 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-08 11:04:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:49,833 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-08 11:04:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:04:49,833 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-08 11:04:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:49,833 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-08 11:04:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 11:04:49,834 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-08 11:04:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 11:04:49,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-08 11:04:49,876 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-08 11:04:49,878 INFO L225 Difference]: With dead ends: 87 [2022-04-08 11:04:49,878 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 11:04:49,878 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-08 11:04:49,878 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-08 11:04:49,879 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-08 11:04:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 11:04:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-08 11:04:50,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:50,012 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-08 11:04:50,012 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-08 11:04:50,012 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-08 11:04:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:50,015 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-08 11:04:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-08 11:04:50,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:50,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:50,015 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-08 11:04:50,015 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-08 11:04:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:50,017 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-08 11:04:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-08 11:04:50,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:50,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:50,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:50,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:50,017 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-08 11:04:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-04-08 11:04:50,018 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 48 [2022-04-08 11:04:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:50,019 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-04-08 11:04:50,019 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-08 11:04:50,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2022-04-08 11:04:50,164 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-08 11:04:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-08 11:04:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 11:04:50,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:50,165 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-08 11:04:50,183 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-08 11:04:50,366 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-08 11:04:50,366 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-08 11:04:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:50,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481555858] [2022-04-08 11:04:50,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-08 11:04:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:50,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926264973] [2022-04-08 11:04:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:50,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:50,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508821660] [2022-04-08 11:04:50,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:04:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:50,385 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-08 11:04:50,385 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-08 11:04:50,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:04:50,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:50,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 11:04:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:50,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:51,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#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; {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-08 11:04:51,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:51,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {5779#(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; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:51,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {5779#(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)); {5723#true} is VALID [2022-04-08 11:04:51,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,157 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:51,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#(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); {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:04:51,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#(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; {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:51,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 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; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:51,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 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; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:51,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 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)); {5723#true} is VALID [2022-04-08 11:04:51,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:51,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,160 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:51,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:04:51,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 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 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} is VALID [2022-04-08 11:04:51,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:04:51,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* 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-08 11:04:51,162 INFO L272 TraceCheckUtils]: 37: Hoare triple {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* 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)); {5723#true} is VALID [2022-04-08 11:04:51,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:51,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,173 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* 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; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:04:51,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:04:51,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (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; {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-08 11:04:51,175 INFO L272 TraceCheckUtils]: 44: Hoare triple {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (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)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:51,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:51,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-08 11:04:51,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-08 11:04:51,176 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-08 11:04:51,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:04:51,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-08 11:04:51,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-08 11:04:51,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:04:51,773 INFO L272 TraceCheckUtils]: 44: Hoare triple {5891#(= (+ (* 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)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:04:51,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {5895#(= (+ (* 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; {5891#(= (+ (* 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-08 11:04:51,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {5899#(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); {5895#(= (+ (* 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-08 11:04:51,775 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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)))))} #65#return; {5899#(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-08 11:04:51,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:04:51,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:04:51,776 INFO L272 TraceCheckUtils]: 37: Hoare triple {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 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_~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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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-08 11:04:51,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {5924#(or (not (= (+ (* (* 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))))) (= (+ (* (* (+ main_~x~0 1) 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)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 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_~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-08 11:04:51,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ 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))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* 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 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5924#(or (not (= (+ (* (* 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))))) (= (+ (* (* (+ main_~x~0 1) 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)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:04:51,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ 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))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:04:51,848 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L272 TraceCheckUtils]: 28: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {5723#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {5723#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; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L272 TraceCheckUtils]: 19: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-08 11:04:51,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#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; {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5723#true} is VALID [2022-04-08 11:04:51,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-08 11:04:51,850 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-08 11:04:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:04:51,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926264973] [2022-04-08 11:04:51,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:04:51,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508821660] [2022-04-08 11:04:51,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508821660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:04:51,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:04:51,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-08 11:04:51,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:04:51,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481555858] [2022-04-08 11:04:51,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481555858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:04:51,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:04:51,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:04:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917964141] [2022-04-08 11:04:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:04:51,852 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:51,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:04:51,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:51,900 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-08 11:04:51,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:04:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:04:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:04:51,901 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:53,261 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-08 11:04:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:04:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:04:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:04:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:04:53,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-08 11:04:53,311 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-08 11:04:53,313 INFO L225 Difference]: With dead ends: 90 [2022-04-08 11:04:53,313 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:04:53,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:04:53,314 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:04:53,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 11:04:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:04:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-04-08 11:04:53,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:04:53,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 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-08 11:04:53,447 INFO L74 IsIncluded]: Start isIncluded. First operand 82 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-08 11:04:53,447 INFO L87 Difference]: Start difference. First operand 82 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-08 11:04:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:53,449 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 11:04:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 11:04:53,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:53,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:53,449 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 82 states. [2022-04-08 11:04:53,450 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 82 states. [2022-04-08 11:04:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:04:53,451 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 11:04:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 11:04:53,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:04:53,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:04:53,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:04:53,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:04:53,452 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-08 11:04:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-08 11:04:53,454 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 48 [2022-04-08 11:04:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:04:53,454 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-08 11:04:53,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) 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-08 11:04:53,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-08 11:04:53,611 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-08 11:04:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-08 11:04:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:04:53,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:04:53,611 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-08 11:04:53,628 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-08 11:04:53,812 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-08 11:04:53,812 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:04:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:04:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 5 times [2022-04-08 11:04:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:04:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88917467] [2022-04-08 11:04:53,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:04:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 6 times [2022-04-08 11:04:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:04:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132760489] [2022-04-08 11:04:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:04:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:04:53,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:04:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564249163] [2022-04-08 11:04:53,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:04:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:04:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:04:53,825 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-08 11:04:53,826 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-08 11:04:53,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:04:53,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:04:53,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 11:04:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:04:53,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:04:59,784 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:05:01,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-08 11:05:01,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6531#true} is VALID [2022-04-08 11:05:01,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:01,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#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; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:01,601 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-08 11:05:01,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#(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; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,602 INFO L272 TraceCheckUtils]: 19: Hoare triple {6587#(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)); {6531#true} is VALID [2022-04-08 11:05:01,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:01,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:01,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:01,603 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#(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; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:05:01,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {6612#(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; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:05:01,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {6612#(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; {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:05:01,605 INFO L272 TraceCheckUtils]: 28: Hoare triple {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= 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)); {6531#true} is VALID [2022-04-08 11:05:01,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:01,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:01,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:01,606 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:05:01,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:05:01,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {6612#(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; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:01,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* 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-08 11:05:01,608 INFO L272 TraceCheckUtils]: 37: Hoare triple {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* 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)); {6531#true} is VALID [2022-04-08 11:05:01,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:01,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:01,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:01,610 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~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 0))} is VALID [2022-04-08 11:05:01,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~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 0))} assume !!(~x~0 <= ~X~0); {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~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 0))} is VALID [2022-04-08 11:05:01,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~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 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:05:01,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:05:01,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:05:01,617 INFO L272 TraceCheckUtils]: 46: Hoare triple {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 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)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:01,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:01,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-08 11:05:01,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-08 11:05:01,618 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-08 11:05:01,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:05:02,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-08 11:05:02,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-08 11:05:02,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:02,979 INFO L272 TraceCheckUtils]: 46: Hoare triple {6705#(= (+ (* 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)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:02,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {6709#(= (+ (* 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; {6705#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:05:03,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {6713#(= (+ (* (* 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; {6709#(= (+ (* 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-08 11:05:03,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {6709#(= (+ (* 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; {6713#(= (+ (* (* 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-08 11:05:03,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(= (+ (* 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); {6709#(= (+ (* 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-08 11:05:03,007 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6723#(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; {6709#(= (+ (* 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-08 11:05:03,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:03,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:03,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:05:03,008 INFO L272 TraceCheckUtils]: 37: Hoare triple {6723#(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)); {6531#true} is VALID [2022-04-08 11:05:03,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6723#(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-08 11:05:03,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-08 11:05:03,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L272 TraceCheckUtils]: 19: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:03,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#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; {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6531#true} is VALID [2022-04-08 11:05:03,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-08 11:05:03,011 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-08 11:05:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:05:03,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132760489] [2022-04-08 11:05:03,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:05:03,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564249163] [2022-04-08 11:05:03,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564249163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:05:03,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:05:03,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-08 11:05:03,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:05:03,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88917467] [2022-04-08 11:05:03,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88917467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:05:03,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:05:03,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:05:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798420044] [2022-04-08 11:05:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:05:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) 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 50 [2022-04-08 11:05:03,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:05:03,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) 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-08 11:05:03,049 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-08 11:05:03,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:05:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:05:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:05:03,050 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 15 states, 12 states have (on average 2.5) 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-08 11:05:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:04,350 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-04-08 11:05:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:05:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) 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 50 [2022-04-08 11:05:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:05:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) 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-08 11:05:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:05:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) 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-08 11:05:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:05:04,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-08 11:05:04,419 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-08 11:05:04,420 INFO L225 Difference]: With dead ends: 88 [2022-04-08 11:05:04,420 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 11:05:04,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:05:04,421 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:05:04,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 198 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:05:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 11:05:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-04-08 11:05:04,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:05:04,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:05:04,556 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:05:04,556 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:05:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:04,557 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-08 11:05:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-08 11:05:04,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:04,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:04,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-08 11:05:04,558 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-08 11:05:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:04,559 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-08 11:05:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-08 11:05:04,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:04,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:04,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:05:04,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:05:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:05:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-04-08 11:05:04,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 50 [2022-04-08 11:05:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:05:04,561 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-04-08 11:05:04,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) 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-08 11:05:04,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 83 transitions. [2022-04-08 11:05:04,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-04-08 11:05:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:05:04,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:05:04,727 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-08 11:05:04,752 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-08 11:05:04,927 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-08 11:05:04,927 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:05:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:05:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-08 11:05:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282310411] [2022-04-08 11:05:04,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:05:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-08 11:05:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:05:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802095911] [2022-04-08 11:05:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:05:04,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:05:04,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:05:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475671374] [2022-04-08 11:05:04,938 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:05:04,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:05:04,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:05:04,939 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-08 11:05:04,940 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-08 11:05:04,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:05:04,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:05:04,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 11:05:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:05:04,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:05:05,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-08 11:05:05,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7352#true} is VALID [2022-04-08 11:05:05,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:05,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-08 11:05:05,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-08 11:05:05,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#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; {7352#true} is VALID [2022-04-08 11:05:05,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:05,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:05:05,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:05:05,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:05:05,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} {7352#true} #61#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:05:05,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:05:05,784 INFO L272 TraceCheckUtils]: 12: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:05,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:05,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:05,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:05,784 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:05:05,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,785 INFO L272 TraceCheckUtils]: 19: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 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)); {7352#true} is VALID [2022-04-08 11:05:05,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:05,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:05,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:05,786 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 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)); {7352#true} is VALID [2022-04-08 11:05:05,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:05,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:05,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:05,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:05:05,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-08 11:05:05,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= 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; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 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-08 11:05:05,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* 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))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} is VALID [2022-04-08 11:05:05,791 INFO L272 TraceCheckUtils]: 37: Hoare triple {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* 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))) (= 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)); {7352#true} is VALID [2022-04-08 11:05:05,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:05,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:05,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:05,793 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* 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))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} #65#return; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 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-08 11:05:05,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 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 !!(~x~0 <= ~X~0); {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-08 11:05:05,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~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; {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} is VALID [2022-04-08 11:05:05,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-08 11:05:05,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-08 11:05:05,796 INFO L272 TraceCheckUtils]: 46: Hoare triple {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= 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)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:05,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:05,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-08 11:05:05,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-08 11:05:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 11:05:05,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:05:12,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-08 11:05:12,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-08 11:05:12,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:12,305 INFO L272 TraceCheckUtils]: 46: Hoare triple {7530#(= (+ (* 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)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:12,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#(= (+ (* 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; {7530#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:05:12,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {7538#(= (+ (* (* 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; {7534#(= (+ (* 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-08 11:05:12,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {7542#(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; {7538#(= (+ (* (* 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-08 11:05:12,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {7546#(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); {7542#(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-08 11:05:12,319 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7550#(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)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {7546#(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-08 11:05:12,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:12,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:12,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:05:12,320 INFO L272 TraceCheckUtils]: 37: Hoare triple {7550#(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)))) (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)); {7352#true} is VALID [2022-04-08 11:05:12,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7550#(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)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:05:12,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-08 11:05:12,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-08 11:05:12,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-08 11:05:12,321 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L272 TraceCheckUtils]: 28: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:12,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {7352#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7352#true} #63#return; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L272 TraceCheckUtils]: 12: Hoare triple {7352#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {7352#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7352#true} {7352#true} #61#return; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#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; {7352#true} is VALID [2022-04-08 11:05:12,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-08 11:05:12,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-08 11:05:12,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-08 11:05:12,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7352#true} is VALID [2022-04-08 11:05:12,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-08 11:05:12,324 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-08 11:05:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:05:12,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802095911] [2022-04-08 11:05:12,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:05:12,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475671374] [2022-04-08 11:05:12,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475671374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:05:12,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:05:12,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-08 11:05:12,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:05:12,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282310411] [2022-04-08 11:05:12,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282310411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:05:12,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:05:12,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 11:05:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66784991] [2022-04-08 11:05:12,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:05:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-08 11:05:12,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:05:12,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:05:12,367 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-08 11:05:12,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 11:05:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 11:05:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:05:12,368 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:05:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:14,061 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-04-08 11:05:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 11:05:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-08 11:05:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:05:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:05:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-08 11:05:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:05:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-08 11:05:14,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 77 transitions. [2022-04-08 11:05:14,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:14,134 INFO L225 Difference]: With dead ends: 101 [2022-04-08 11:05:14,135 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 11:05:14,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2022-04-08 11:05:14,135 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:05:14,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 209 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 11:05:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 11:05:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-08 11:05:14,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:05:14,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:05:14,316 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:05:14,316 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:05:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:14,318 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 11:05:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 11:05:14,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:14,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:14,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-08 11:05:14,319 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-08 11:05:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:05:14,320 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 11:05:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 11:05:14,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:05:14,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:05:14,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:05:14,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:05:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:05:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-04-08 11:05:14,323 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 50 [2022-04-08 11:05:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:05:14,323 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-04-08 11:05:14,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:05:14,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 95 transitions. [2022-04-08 11:05:14,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:05:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 11:05:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:05:14,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:05:14,497 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-08 11:05:14,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 11:05:14,697 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-08 11:05:14,698 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:05:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:05:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-08 11:05:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463222032] [2022-04-08 11:05:14,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:05:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-08 11:05:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:05:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984297422] [2022-04-08 11:05:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:05:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:05:14,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:05:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859737832] [2022-04-08 11:05:14,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:05:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:05:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:05:14,719 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-08 11:05:14,720 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-08 11:05:14,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:05:14,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:05:14,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 11:05:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:05:14,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:05:26,425 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:05:34,773 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:05:38,895 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:05:48,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-08 11:05:48,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#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; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:48,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:48,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:48,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-08 11:05:48,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {8297#(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; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,739 INFO L272 TraceCheckUtils]: 19: Hoare triple {8297#(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)); {8241#true} is VALID [2022-04-08 11:05:48,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:48,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:48,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:48,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {8297#(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; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {8322#(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; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:05:48,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {8322#(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; {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-08 11:05:48,742 INFO L272 TraceCheckUtils]: 28: Hoare triple {8329#(and (= main_~xy~0 0) (= main_~v~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)); {8241#true} is VALID [2022-04-08 11:05:48,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:48,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:48,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:48,743 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-08 11:05:48,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !!(~x~0 <= ~X~0); {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-08 11:05:48,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {8347#(= (+ main_~X~0 main_~v~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; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:05:48,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:05:48,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {8354#(= (* main_~Y~0 4) (+ 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; {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:05:48,745 INFO L272 TraceCheckUtils]: 37: Hoare triple {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~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)); {8241#true} is VALID [2022-04-08 11:05:48,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:48,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:48,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:48,747 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {8377#(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 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:05:48,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {8377#(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 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {8377#(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 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:05:48,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {8377#(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 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8384#(and (= (+ (* 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-08 11:05:48,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {8384#(and (= (+ (* 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; {8388#(and (= 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-08 11:05:50,753 WARN L290 TraceCheckUtils]: 45: Hoare triple {8388#(and (= 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; {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 0))))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is UNKNOWN [2022-04-08 11:05:50,756 INFO L272 TraceCheckUtils]: 46: Hoare triple {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 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)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:50,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:50,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-08 11:05:50,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-08 11:05:50,757 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-08 11:05:50,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:05:53,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-08 11:05:53,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-08 11:05:53,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:05:53,872 INFO L272 TraceCheckUtils]: 46: Hoare triple {8416#(= (+ (* 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)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:05:53,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {8420#(= (+ (* 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; {8416#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:05:53,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {8424#(= (+ (* (* 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; {8420#(= (+ (* 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-08 11:05:53,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {8420#(= (+ (* 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; {8424#(= (+ (* (* 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-08 11:05:53,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {8420#(= (+ (* 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); {8420#(= (+ (* 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-08 11:05:53,876 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8434#(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; {8420#(= (+ (* 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-08 11:05:53,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:53,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:05:53,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:05:53,877 INFO L272 TraceCheckUtils]: 37: Hoare triple {8434#(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)); {8241#true} is VALID [2022-04-08 11:05:53,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8434#(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-08 11:05:53,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#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; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L272 TraceCheckUtils]: 28: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {8241#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-08 11:05:53,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L272 TraceCheckUtils]: 19: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:53,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#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; {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8241#true} is VALID [2022-04-08 11:05:53,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-08 11:05:53,880 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-08 11:05:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:05:53,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984297422] [2022-04-08 11:05:53,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:05:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859737832] [2022-04-08 11:05:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859737832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:05:53,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:05:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-08 11:05:53,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:05:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463222032] [2022-04-08 11:05:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463222032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:05:53,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:05:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:05:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747605765] [2022-04-08 11:05:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:05:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:05:53,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:05:53,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:05:55,931 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-08 11:05:55,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:05:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:05:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:05:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-08 11:05:55,932 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:05:59,565 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-08 11:06:11,701 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-08 11:06:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:21,105 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-04-08 11:06:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:06:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:06:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:06:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:06:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:06:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:06:21,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-08 11:06:23,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:23,186 INFO L225 Difference]: With dead ends: 106 [2022-04-08 11:06:23,186 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 11:06:23,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2022-04-08 11:06:23,186 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:23,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 213 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 428 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-04-08 11:06:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 11:06:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-08 11:06:23,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:23,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:06:23,376 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:06:23,376 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:06:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:23,378 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-08 11:06:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-08 11:06:23,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:23,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:23,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-08 11:06:23,379 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-08 11:06:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:23,381 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-08 11:06:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-08 11:06:23,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:23,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:23,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:23,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:06:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-04-08 11:06:23,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 50 [2022-04-08 11:06:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:23,384 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-04-08 11:06:23,384 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 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-08 11:06:23,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 109 transitions. [2022-04-08 11:06:25,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 108 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-04-08 11:06:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:06:25,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:25,667 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-08 11:06:25,684 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-08 11:06:25,868 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-08 11:06:25,868 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 9 times [2022-04-08 11:06:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:25,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263057082] [2022-04-08 11:06:25,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 10 times [2022-04-08 11:06:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:25,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379552947] [2022-04-08 11:06:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:25,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93305040] [2022-04-08 11:06:25,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:06:25,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:25,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:25,883 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-08 11:06:25,884 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-08 11:06:25,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:06:25,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:25,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:06:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:25,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:06:26,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#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; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-08 11:06:26,252 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-08 11:06:26,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,253 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-08 11:06:26,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-08 11:06:26,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-08 11:06:26,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {9247#(<= (* 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)); {9191#true} is VALID [2022-04-08 11:06:26,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,259 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} #65#return; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-08 11:06:26,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-08 11:06:26,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:06:26,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {9272#(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; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:06:26,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {9272#(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; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:06:26,261 INFO L272 TraceCheckUtils]: 28: Hoare triple {9272#(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)); {9191#true} is VALID [2022-04-08 11:06:26,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,261 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #65#return; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:06:26,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {9272#(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; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-08 11:06:26,263 INFO L272 TraceCheckUtils]: 37: Hoare triple {9300#(< 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)); {9191#true} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,264 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #65#return; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-08 11:06:26,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !!(~x~0 <= ~X~0); {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-08 11:06:26,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {9300#(< 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; {9192#false} is VALID [2022-04-08 11:06:26,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-08 11:06:26,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-08 11:06:26,265 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-08 11:06:26,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-08 11:06:26,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-08 11:06:26,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-08 11:06:26,266 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-08 11:06:26,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-08 11:06:26,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {9364#(< 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; {9192#false} is VALID [2022-04-08 11:06:26,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {9364#(< main_~v~0 0)} assume !!(~x~0 <= ~X~0); {9364#(< main_~v~0 0)} is VALID [2022-04-08 11:06:26,449 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9364#(< main_~v~0 0)} #65#return; {9364#(< main_~v~0 0)} is VALID [2022-04-08 11:06:26,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,450 INFO L272 TraceCheckUtils]: 37: Hoare triple {9364#(< 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)); {9191#true} is VALID [2022-04-08 11:06:26,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {9364#(< main_~v~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9364#(< main_~v~0 0)} is VALID [2022-04-08 11:06:26,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {9364#(< main_~v~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9364#(< main_~v~0 0)} is VALID [2022-04-08 11:06:26,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {9392#(< (+ 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; {9364#(< main_~v~0 0)} is VALID [2022-04-08 11:06:26,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !!(~x~0 <= ~X~0); {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-08 11:06:26,451 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #65#return; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-08 11:06:26,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,452 INFO L272 TraceCheckUtils]: 28: Hoare triple {9392#(< (+ 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)); {9191#true} is VALID [2022-04-08 11:06:26,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {9392#(< (+ 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; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-08 11:06:26,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-08 11:06:26,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(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; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-08 11:06:26,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-08 11:06:26,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} #65#return; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-08 11:06:26,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {9420#(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)); {9191#true} is VALID [2022-04-08 11:06:26,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {9420#(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; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-08 11:06:26,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-08 11:06:26,455 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-08 11:06:26,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#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; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9191#true} is VALID [2022-04-08 11:06:26,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-08 11:06:26,457 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-08 11:06:26,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:06:26,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379552947] [2022-04-08 11:06:26,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:06:26,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93305040] [2022-04-08 11:06:26,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93305040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:06:26,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:06:26,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 11:06:26,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:06:26,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263057082] [2022-04-08 11:06:26,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263057082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:26,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:06:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232214184] [2022-04-08 11:06:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:06:26,458 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-08 11:06:26,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:06:26,458 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-08 11:06:26,487 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-08 11:06:26,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:06:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:06:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:06:26,488 INFO L87 Difference]: Start difference. First operand 100 states and 109 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-08 11:06:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:26,928 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2022-04-08 11:06:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:06:26,928 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-08 11:06:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:26,928 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-08 11:06:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:06:26,929 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-08 11:06:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:06:26,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-08 11:06:26,992 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-08 11:06:26,993 INFO L225 Difference]: With dead ends: 131 [2022-04-08 11:06:26,993 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 11:06:26,994 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-08 11:06:26,994 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:26,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:06:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 11:06:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-04-08 11:06:27,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:27,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:06:27,258 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:06:27,258 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:06:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:27,261 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-08 11:06:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-08 11:06:27,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:27,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:27,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 11:06:27,262 INFO L87 Difference]: Start difference. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 11:06:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:27,264 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-08 11:06:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-08 11:06:27,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:27,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:27,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:27,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:06:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2022-04-08 11:06:27,267 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 50 [2022-04-08 11:06:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:27,268 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2022-04-08 11:06:27,268 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-08 11:06:27,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 127 transitions. [2022-04-08 11:06:29,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 126 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-08 11:06:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:06:29,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:29,592 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-08 11:06:29,608 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-08 11:06:29,807 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-08 11:06:29,807 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-08 11:06:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:29,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020592358] [2022-04-08 11:06:29,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-08 11:06:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:29,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503566969] [2022-04-08 11:06:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:29,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:29,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199345893] [2022-04-08 11:06:29,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:06:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:29,818 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-08 11:06:29,819 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-08 11:06:29,860 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:06:29,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:29,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 11:06:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:29,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:06:30,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-08 11:06:30,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#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; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-08 11:06:30,468 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:30,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:06:30,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:06:30,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:06:30,476 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} {10224#true} #63#return; {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,477 INFO L272 TraceCheckUtils]: 19: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:30,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:30,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:30,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:30,477 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} 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; {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,480 INFO L272 TraceCheckUtils]: 28: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:30,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:30,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:30,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:30,481 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,483 INFO L272 TraceCheckUtils]: 37: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:30,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:30,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:30,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:30,484 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #65#return; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:06:30,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} 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; {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:06:30,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:06:30,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ 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; {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:06:30,487 INFO L272 TraceCheckUtils]: 46: Hoare triple {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ 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)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:06:30,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:06:30,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-08 11:06:30,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-08 11:06:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 11:06:30,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:06:31,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-08 11:06:31,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-08 11:06:31,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:06:31,073 INFO L272 TraceCheckUtils]: 46: Hoare triple {10398#(= (+ (* 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)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:06:31,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {10402#(= (+ (* 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; {10398#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:06:31,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {10406#(= (+ (* (* 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; {10402#(= (+ (* 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-08 11:06:31,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {10402#(= (+ (* 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; {10406#(= (+ (* (* 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-08 11:06:31,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {10402#(= (+ (* 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); {10402#(= (+ (* 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-08 11:06:31,078 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10402#(= (+ (* 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; {10402#(= (+ (* 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-08 11:06:31,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:31,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:31,079 INFO L272 TraceCheckUtils]: 37: Hoare triple {10402#(= (+ (* 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)); {10224#true} is VALID [2022-04-08 11:06:31,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {10402#(= (+ (* 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; {10402#(= (+ (* 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-08 11:06:31,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {10406#(= (+ (* (* 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; {10402#(= (+ (* 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-08 11:06:31,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {10437#(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; {10406#(= (+ (* (* 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-08 11:06:31,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {10437#(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); {10437#(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-08 11:06:31,082 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10437#(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)))))} #65#return; {10437#(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-08 11:06:31,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:31,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:31,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {10437#(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)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:31,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {10437#(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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10437#(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-08 11:06:31,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10437#(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-08 11:06:31,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {10466#(or (= (+ 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))) (not (< (+ 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; {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:06:31,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !!(~x~0 <= ~X~0); {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-08 11:06:31,088 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} #65#return; {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-08 11:06:31,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:31,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:31,088 INFO L272 TraceCheckUtils]: 19: Hoare triple {10466#(or (= (+ 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))) (not (< (+ 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)); {10224#true} is VALID [2022-04-08 11:06:31,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {10466#(or (= (+ 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))) (not (< (+ 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; {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-08 11:06:31,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {10224#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10466#(or (= (+ 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))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-08 11:06:31,089 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10224#true} {10224#true} #63#return; {10224#true} is VALID [2022-04-08 11:06:31,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:31,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#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; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10224#true} is VALID [2022-04-08 11:06:31,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-08 11:06:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 11:06:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:06:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503566969] [2022-04-08 11:06:31,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:06:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199345893] [2022-04-08 11:06:31,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199345893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:06:31,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:06:31,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2022-04-08 11:06:31,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:06:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020592358] [2022-04-08 11:06:31,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020592358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:31,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:31,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:06:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733446061] [2022-04-08 11:06:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:06:31,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:06:31,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:06:31,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:06:31,128 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-08 11:06:31,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:06:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:31,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:06:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-04-08 11:06:31,129 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:06:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:32,430 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-08 11:06:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:06:32,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:06:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:06:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 11:06:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:06:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 11:06:32,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-08 11:06:32,506 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-08 11:06:32,508 INFO L225 Difference]: With dead ends: 126 [2022-04-08 11:06:32,508 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 11:06:32,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:06:32,508 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:32,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:06:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 11:06:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2022-04-08 11:06:32,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:32,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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-08 11:06:32,800 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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-08 11:06:32,800 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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-08 11:06:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:32,803 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-08 11:06:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-08 11:06:32,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:32,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:32,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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 124 states. [2022-04-08 11:06:32,804 INFO L87 Difference]: Start difference. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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 124 states. [2022-04-08 11:06:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:32,806 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-08 11:06:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-08 11:06:32,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:32,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:32,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:32,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 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-08 11:06:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-04-08 11:06:32,810 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 50 [2022-04-08 11:06:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:32,810 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-04-08 11:06:32,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) 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), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:06:32,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 134 transitions. [2022-04-08 11:06:35,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 133 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-08 11:06:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:06:35,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:35,150 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-08 11:06:35,172 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-08 11:06:35,350 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-08 11:06:35,351 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-08 11:06:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:35,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209867537] [2022-04-08 11:06:35,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-08 11:06:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:35,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576967964] [2022-04-08 11:06:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:35,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:35,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903034726] [2022-04-08 11:06:35,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:06:35,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:35,362 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-08 11:06:35,363 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-08 11:06:35,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:06:35,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:35,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 11:06:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:35,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:06:49,996 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:06:54,061 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:06:58,115 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:09,917 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:15,605 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:52,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-08 11:07:52,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11290#true} is VALID [2022-04-08 11:07:52,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:07:52,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-08 11:07:52,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#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; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:07:52,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:07:52,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-08 11:07:52,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:07:52,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:07:52,215 INFO L272 TraceCheckUtils]: 19: Hoare triple {11346#(= (+ 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)); {11290#true} is VALID [2022-04-08 11:07:52,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:07:52,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:07:52,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:07:52,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:07:52,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:07:52,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {11346#(= (+ 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; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:07:52,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {11371#(= (* 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; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:07:54,220 WARN L290 TraceCheckUtils]: 27: Hoare triple {11371#(= (* 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; {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is UNKNOWN [2022-04-08 11:07:54,220 INFO L272 TraceCheckUtils]: 28: Hoare triple {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 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)); {11290#true} is VALID [2022-04-08 11:07:54,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:54,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,222 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} #65#return; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:07:54,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !!(~x~0 <= ~X~0); {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-08 11:07:54,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {11371#(= (* 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; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-08 11:07:54,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-08 11:07:54,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:07:54,224 INFO L272 TraceCheckUtils]: 37: Hoare triple {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* 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)); {11290#true} is VALID [2022-04-08 11:07:54,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:54,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,226 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* 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-08 11:07:54,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* 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); {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* 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-08 11:07:54,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* 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; {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= 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))))} is VALID [2022-04-08 11:07:54,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= 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))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= 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))))} is VALID [2022-04-08 11:07:56,235 WARN L290 TraceCheckUtils]: 45: Hoare triple {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= 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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= 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_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= main_~Y~0 0))))))} is UNKNOWN [2022-04-08 11:07:56,242 INFO L272 TraceCheckUtils]: 46: Hoare triple {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= 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_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= 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)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:56,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:56,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-08 11:07:56,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-08 11:07:56,243 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-08 11:07:56,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:01,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-08 11:08:01,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-08 11:08:01,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:01,134 INFO L272 TraceCheckUtils]: 46: Hoare triple {11464#(= (+ (* 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)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:01,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {11468#(= (+ (* 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; {11464#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:01,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {11472#(= (+ (* (* 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; {11468#(= (+ (* 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-08 11:08:01,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {11468#(= (+ (* 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; {11472#(= (+ (* (* 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-08 11:08:01,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {11468#(= (+ (* 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); {11468#(= (+ (* 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-08 11:08:01,140 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11482#(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; {11468#(= (+ (* 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-08 11:08:01,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:01,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:01,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:08:01,141 INFO L272 TraceCheckUtils]: 37: Hoare triple {11482#(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)); {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11482#(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-08 11:08:01,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {11290#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; {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:08:01,142 INFO L272 TraceCheckUtils]: 28: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {11290#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; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L272 TraceCheckUtils]: 19: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:08:01,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#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; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11290#true} is VALID [2022-04-08 11:08:01,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-08 11:08:01,145 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-08 11:08:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576967964] [2022-04-08 11:08:01,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:01,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903034726] [2022-04-08 11:08:01,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903034726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:01,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:01,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-08 11:08:01,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:01,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209867537] [2022-04-08 11:08:01,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209867537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:01,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:01,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:08:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785967808] [2022-04-08 11:08:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:01,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) 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 50 [2022-04-08 11:08:01,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:01,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) 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-08 11:08:05,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:05,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:08:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:05,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:08:05,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=327, Unknown=1, NotChecked=0, Total=380 [2022-04-08 11:08:05,215 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 15 states, 12 states have (on average 2.5) 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-08 11:08:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:14,900 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-08 11:08:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:08:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) 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 50 [2022-04-08 11:08:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) 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-08 11:08:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:08:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) 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-08 11:08:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-08 11:08:14,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-08 11:08:18,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:18,991 INFO L225 Difference]: With dead ends: 134 [2022-04-08 11:08:18,991 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 11:08:18,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=80, Invalid=470, Unknown=2, NotChecked=0, Total=552 [2022-04-08 11:08:18,991 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:18,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 211 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 45 Unchecked, 1.5s Time] [2022-04-08 11:08:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 11:08:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-08 11:08:19,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:19,254 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-08 11:08:19,254 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-08 11:08:19,254 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-08 11:08:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:19,256 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-08 11:08:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-08 11:08:19,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:19,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:19,257 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-08 11:08:19,257 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-08 11:08:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:19,259 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-08 11:08:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-08 11:08:19,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:19,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:19,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:19,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:19,259 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-08 11:08:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-08 11:08:19,261 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-08 11:08:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:19,261 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-08 11:08:19,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) 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-08 11:08:19,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-08 11:08:23,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-08 11:08:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:08:23,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:23,652 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-08 11:08:23,669 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-08 11:08:23,853 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-08 11:08:23,853 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-08 11:08:23,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:23,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104775190] [2022-04-08 11:08:23,855 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-08 11:08:23,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:23,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345330067] [2022-04-08 11:08:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:23,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:23,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885470760] [2022-04-08 11:08:23,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:08:23,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:23,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:23,867 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-08 11:08:23,868 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-08 11:08:23,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:08:23,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:23,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-08 11:08:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:23,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:24,238 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:08:35,635 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:08:35,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#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; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-08 11:08:35,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:35,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:35,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:35,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:35,979 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-08 11:08:35,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:35,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {12447#(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; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:35,980 INFO L272 TraceCheckUtils]: 19: Hoare triple {12447#(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)); {12391#true} is VALID [2022-04-08 11:08:35,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:35,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:35,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:35,980 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:35,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#(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); {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:35,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#(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; {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-08 11:08:35,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-08 11:08:35,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} is VALID [2022-04-08 11:08:35,983 INFO L272 TraceCheckUtils]: 28: Hoare triple {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~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)); {12391#true} is VALID [2022-04-08 11:08:35,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:35,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:35,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:35,985 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} #65#return; {12498#(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_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-08 11:08:35,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {12498#(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_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {12498#(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_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-08 11:08:35,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {12498#(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_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= 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; {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} is VALID [2022-04-08 11:08:35,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} is VALID [2022-04-08 11:08:35,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:08:35,987 INFO L272 TraceCheckUtils]: 37: Hoare triple {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* 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)); {12391#true} is VALID [2022-04-08 11:08:35,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:35,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:35,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:35,989 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= 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)))} is VALID [2022-04-08 11:08:35,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= 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)))} assume !!(~x~0 <= ~X~0); {12533#(and (<= 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)) (= main_~x~0 2) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-08 11:08:35,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {12533#(and (<= 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)) (= main_~x~0 2) (= (+ 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; {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-08 11:08:35,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-08 11:08:35,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) main_~X~0)) main_~xy~0))} is VALID [2022-04-08 11:08:35,996 INFO L272 TraceCheckUtils]: 46: Hoare triple {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) 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)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:35,997 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:35,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-08 11:08:35,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-08 11:08:35,998 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-08 11:08:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:39,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-08 11:08:39,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-08 11:08:39,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:39,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {12569#(= (+ (* 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)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:39,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {12573#(= (+ (* 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; {12569#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:39,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {12577#(= (+ (* (* 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; {12573#(= (+ (* 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-08 11:08:39,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {12573#(= (+ (* 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; {12577#(= (+ (* (* 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-08 11:08:39,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {12584#(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); {12573#(= (+ (* 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-08 11:08:39,082 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12588#(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; {12584#(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-08 11:08:39,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:39,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:39,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:08:39,083 INFO L272 TraceCheckUtils]: 37: Hoare triple {12588#(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)); {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12588#(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-08 11:08:39,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {12391#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; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L272 TraceCheckUtils]: 28: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-08 11:08:39,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {12391#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; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L272 TraceCheckUtils]: 19: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:39,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#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; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-08 11:08:39,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12391#true} is VALID [2022-04-08 11:08:39,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-08 11:08:39,088 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-08 11:08:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345330067] [2022-04-08 11:08:39,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885470760] [2022-04-08 11:08:39,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885470760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:39,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:39,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 25 [2022-04-08 11:08:39,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:39,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [104775190] [2022-04-08 11:08:39,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [104775190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:39,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:39,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 11:08:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302399385] [2022-04-08 11:08:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:39,089 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-08 11:08:39,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:39,090 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-08 11:08:39,142 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-08 11:08:39,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 11:08:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 11:08:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-04-08 11:08:39,143 INFO L87 Difference]: Start difference. First operand 121 states and 136 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-08 11:08:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:43,477 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-08 11:08:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 11:08:43,477 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-08 11:08:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:43,478 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-08 11:08:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-08 11:08:43,479 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-08 11:08:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-08 11:08:43,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2022-04-08 11:08:43,564 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-08 11:08:43,566 INFO L225 Difference]: With dead ends: 134 [2022-04-08 11:08:43,566 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 11:08:43,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-04-08 11:08:43,567 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:43,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 256 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 11:08:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 11:08:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-08 11:08:43,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:43,857 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-08 11:08:43,857 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-08 11:08:43,857 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-08 11:08:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:43,859 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-08 11:08:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-08 11:08:43,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:43,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:43,860 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-08 11:08:43,860 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-08 11:08:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:43,862 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-08 11:08:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-08 11:08:43,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:43,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:43,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:43,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:43,863 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-08 11:08:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-08 11:08:43,866 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-08 11:08:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:43,866 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-08 11:08:43,866 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-08 11:08:43,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-08 11:08:48,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-08 11:08:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:08:48,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:48,265 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-08 11:08:48,281 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-08 11:08:48,472 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-08 11:08:48,473 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-08 11:08:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509556103] [2022-04-08 11:08:48,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-08 11:08:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:48,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470174102] [2022-04-08 11:08:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:48,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:48,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671653141] [2022-04-08 11:08:48,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:08:48,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:48,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:48,486 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-08 11:08:48,487 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-08 11:08:48,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:08:48,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:48,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:08:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:48,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:49,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-08 11:08:49,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13501#true} is VALID [2022-04-08 11:08:49,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-08 11:08:49,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#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; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,421 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-08 11:08:49,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:08:49,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#(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; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:08:49,422 INFO L272 TraceCheckUtils]: 19: Hoare triple {13557#(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)); {13501#true} is VALID [2022-04-08 11:08:49,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,423 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:08:49,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:08:49,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {13557#(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; {13582#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:08:49,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {13582#(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; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:08:49,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {13586#(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; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:08:49,426 INFO L272 TraceCheckUtils]: 28: Hoare triple {13586#(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)); {13501#true} is VALID [2022-04-08 11:08:49,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,427 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:08:49,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:08:49,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {13586#(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; {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {13615#(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; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {13615#(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)); {13501#true} is VALID [2022-04-08 11:08:49,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,431 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,433 INFO L272 TraceCheckUtils]: 46: Hoare triple {13643#(and (<= main_~x~0 3) (< 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)); {13501#true} is VALID [2022-04-08 11:08:49,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,434 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:08:49,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-08 11:08:49,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-08 11:08:49,435 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#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)); {13502#false} is VALID [2022-04-08 11:08:49,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-08 11:08:49,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-08 11:08:49,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-08 11:08:49,435 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-08 11:08:49,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:49,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-08 11:08:49,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-08 11:08:49,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-08 11:08:49,756 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#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)); {13502#false} is VALID [2022-04-08 11:08:49,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-08 11:08:49,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-08 11:08:49,757 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13695#(<= main_~x~0 main_~X~0)} #65#return; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:49,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,757 INFO L272 TraceCheckUtils]: 46: Hoare triple {13695#(<= 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)); {13501#true} is VALID [2022-04-08 11:08:49,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:49,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:49,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:49,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:49,760 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13717#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:49,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,760 INFO L272 TraceCheckUtils]: 37: Hoare triple {13717#(<= (+ 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)); {13501#true} is VALID [2022-04-08 11:08:49,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:49,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {13745#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:49,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {13749#(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; {13745#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-08 11:08:49,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:08:49,763 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:08:49,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,763 INFO L272 TraceCheckUtils]: 28: Hoare triple {13749#(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)); {13501#true} is VALID [2022-04-08 11:08:49,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {13749#(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; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:08:49,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:08:49,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {13778#(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; {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:08:49,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {13778#(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); {13778#(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-08 11:08:49,766 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {13778#(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-08 11:08:49,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,766 INFO L272 TraceCheckUtils]: 19: Hoare triple {13778#(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)); {13501#true} is VALID [2022-04-08 11:08:49,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {13778#(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; {13778#(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-08 11:08:49,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13778#(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-08 11:08:49,768 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-08 11:08:49,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#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; {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13501#true} is VALID [2022-04-08 11:08:49,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-08 11:08:49,769 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-08 11:08:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470174102] [2022-04-08 11:08:49,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671653141] [2022-04-08 11:08:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671653141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:49,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:08:49,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:49,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509556103] [2022-04-08 11:08:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509556103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:49,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:08:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460586218] [2022-04-08 11:08:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:49,771 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-08 11:08:49,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:49,771 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-08 11:08:49,810 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-08 11:08:49,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:08:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:08:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:08:49,811 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-08 11:08:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:50,483 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-08 11:08:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:08:50,483 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-08 11:08:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:50,483 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-08 11:08:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 11:08:50,484 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-08 11:08:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 11:08:50,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-08 11:08:50,561 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-08 11:08:50,562 INFO L225 Difference]: With dead ends: 133 [2022-04-08 11:08:50,562 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 11:08:50,563 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-08 11:08:50,563 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:50,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:08:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 11:08:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-04-08 11:08:50,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:50,875 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-08 11:08:50,875 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-08 11:08:50,875 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-08 11:08:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:50,877 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-08 11:08:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-08 11:08:50,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:50,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:50,877 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-08 11:08:50,878 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-08 11:08:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:50,879 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-08 11:08:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-08 11:08:50,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:50,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:50,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:50,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:50,880 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-08 11:08:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-08 11:08:50,882 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 57 [2022-04-08 11:08:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:50,882 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-08 11:08:50,882 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-08 11:08:50,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-08 11:08:55,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-08 11:08:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:08:55,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:55,302 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-08 11:08:55,319 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-08 11:08:55,518 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-08 11:08:55,519 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-08 11:08:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552391492] [2022-04-08 11:08:55,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-08 11:08:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:55,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099631158] [2022-04-08 11:08:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:55,529 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:55,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800438951] [2022-04-08 11:08:55,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:08:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:55,530 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-08 11:08:55,537 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-08 11:08:55,576 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 11:08:55,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:55,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 11:08:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:55,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:09:12,280 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:09:16,518 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:09:21,981 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:09:27,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-08 11:09:27,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14614#true} is VALID [2022-04-08 11:09:27,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#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; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,274 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-08 11:09:27,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:27,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:27,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {14670#(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)); {14614#true} is VALID [2022-04-08 11:09:27,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:27,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:27,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,276 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:27,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {14692#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:27,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {14692#(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; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,278 INFO L272 TraceCheckUtils]: 28: Hoare triple {14696#(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)); {14614#true} is VALID [2022-04-08 11:09:27,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:27,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:27,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,279 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,281 INFO L272 TraceCheckUtils]: 37: Hoare triple {14696#(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)); {14614#true} is VALID [2022-04-08 11:09:27,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:27,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:27,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:27,281 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14748#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {14748#(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; {14752#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-08 11:09:27,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {14752#(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; {14756#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:09:27,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {14756#(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; {14760#(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-08 11:09:27,284 INFO L272 TraceCheckUtils]: 46: Hoare triple {14760#(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)); {14614#true} is VALID [2022-04-08 11:09:27,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:27,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:27,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:27,286 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14760#(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; {14778#(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-08 11:09:27,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {14778#(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); {14782#(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-08 11:09:29,289 WARN L290 TraceCheckUtils]: 52: Hoare triple {14782#(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; {14786#(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-08 11:09:29,293 INFO L272 TraceCheckUtils]: 53: Hoare triple {14786#(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)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:29,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:29,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-08 11:09:29,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-08 11:09:29,294 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-08 11:09:29,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:09:39,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-08 11:09:39,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-08 11:09:39,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:39,236 INFO L272 TraceCheckUtils]: 53: Hoare triple {14810#(= (+ (* 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)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:39,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {14814#(= (+ (* 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; {14810#(= (+ (* 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-08 11:09:39,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {14818#(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); {14814#(= (+ (* 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-08 11:09:39,240 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14822#(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; {14818#(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-08 11:09:39,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:39,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:39,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:09:39,241 INFO L272 TraceCheckUtils]: 46: Hoare triple {14822#(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)); {14614#true} is VALID [2022-04-08 11:09:39,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {14839#(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; {14822#(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-08 11:09:39,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((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; {14839#(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-08 11:09:39,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= 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; {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((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-08 11:09:39,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-08 11:09:39,252 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {14614#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14614#true} is VALID [2022-04-08 11:09:39,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L272 TraceCheckUtils]: 28: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {14614#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; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-08 11:09:39,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L272 TraceCheckUtils]: 19: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:39,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#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; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-08 11:09:39,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14614#true} is VALID [2022-04-08 11:09:39,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-08 11:09:39,256 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-08 11:09:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:09:39,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099631158] [2022-04-08 11:09:39,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:09:39,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800438951] [2022-04-08 11:09:39,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800438951] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:09:39,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:09:39,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-08 11:09:39,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:09:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552391492] [2022-04-08 11:09:39,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552391492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:09:39,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:09:39,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:09:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115286496] [2022-04-08 11:09:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:09:39,258 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-08 11:09:39,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:09:39,258 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-08 11:09:41,304 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-08 11:09:41,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:09:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:09:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:09:41,305 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-08 11:09:44,673 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-08 11:09:46,813 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-08 11:09:51,402 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-08 11:09:53,472 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-08 11:09:55,869 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-08 11:09:57,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:09:58,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:00,994 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-08 11:10:03,682 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-08 11:10:05,690 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-08 11:10:07,693 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-08 11:10:08,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:10,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:10:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:11,109 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-04-08 11:10:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:10:11,109 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-08 11:10:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:10:11,110 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-08 11:10:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-08 11:10:11,111 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-08 11:10:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-08 11:10:11,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-08 11:10:15,189 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-08 11:10:15,191 INFO L225 Difference]: With dead ends: 168 [2022-04-08 11:10:15,191 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 11:10:15,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-04-08 11:10:15,192 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:10:15,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 269 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 533 Invalid, 9 Unknown, 0 Unchecked, 25.4s Time] [2022-04-08 11:10:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 11:10:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-04-08 11:10:15,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:10:15,618 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-08 11:10:15,618 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-08 11:10:15,618 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-08 11:10:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:15,620 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-08 11:10:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-08 11:10:15,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:15,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:15,621 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-08 11:10:15,621 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-08 11:10:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:10:15,624 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-08 11:10:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-08 11:10:15,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:10:15,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:10:15,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:10:15,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:10:15,624 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-08 11:10:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2022-04-08 11:10:15,627 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 57 [2022-04-08 11:10:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:10:15,627 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2022-04-08 11:10:15,627 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-08 11:10:15,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 184 transitions. [2022-04-08 11:10:18,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 183 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2022-04-08 11:10:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:10:18,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:10:18,247 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-08 11:10:18,265 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-08 11:10:18,451 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-08 11:10:18,451 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:10:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:10:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-08 11:10:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:18,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205610559] [2022-04-08 11:10:18,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:10:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-08 11:10:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:10:18,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943018318] [2022-04-08 11:10:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:10:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:10:18,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:10:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048375280] [2022-04-08 11:10:18,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:10:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:10:18,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:10:18,484 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-08 11:10:18,485 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-08 11:10:18,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 11:10:18,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:10:18,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 11:10:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:10:18,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:10:33,957 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:39,881 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:42,933 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:11:48,210 WARN L232 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 11:12:01,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#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; {15961#true} is VALID [2022-04-08 11:12:01,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:01,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:12:01,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:01,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:01,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} {15961#true} #61#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:01,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:01,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:01,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:01,163 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 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)); {15961#true} is VALID [2022-04-08 11:12:01,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:01,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:01,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:01,164 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} #65#return; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {15998#(and (<= main_~X~0 10) (<= 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; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,166 INFO L272 TraceCheckUtils]: 28: Hoare triple {15998#(and (<= main_~X~0 10) (<= 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)); {15961#true} is VALID [2022-04-08 11:12:01,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:01,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:01,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:01,166 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {15998#(and (<= main_~X~0 10) (<= 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; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,168 INFO L272 TraceCheckUtils]: 37: Hoare triple {15998#(and (<= main_~X~0 10) (<= 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)); {15961#true} is VALID [2022-04-08 11:12:01,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:01,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:01,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:01,169 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 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; {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:01,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16103#(and (<= main_~X~0 10) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:12:01,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {16103#(and (<= main_~X~0 10) (<= 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; {16107#(and (<= main_~X~0 10) (<= 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-08 11:12:01,172 INFO L272 TraceCheckUtils]: 46: Hoare triple {16107#(and (<= main_~X~0 10) (<= 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)); {15961#true} is VALID [2022-04-08 11:12:01,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:01,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:01,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:01,174 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16107#(and (<= main_~X~0 10) (<= 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; {16125#(and (<= main_~X~0 10) (= (+ (* 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-08 11:12:01,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {16125#(and (<= main_~X~0 10) (= (+ (* 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); {16129#(and (<= main_~X~0 10) (= (+ (* 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-08 11:12:01,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {16129#(and (<= main_~X~0 10) (= (+ (* 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; {16133#(and (<= main_~X~0 10) (<= 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 VALID [2022-04-08 11:12:01,251 INFO L272 TraceCheckUtils]: 53: Hoare triple {16133#(and (<= main_~X~0 10) (<= 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)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:01,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:01,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-08 11:12:01,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-08 11:12:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 11:12:01,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:10,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-08 11:12:10,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-08 11:12:10,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:10,583 INFO L272 TraceCheckUtils]: 53: Hoare triple {16157#(= (+ (* 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)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:10,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {16161#(= (+ (* 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; {16157#(= (+ (* 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-08 11:12:10,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {16165#(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); {16161#(= (+ (* 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-08 11:12:10,586 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16169#(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; {16165#(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-08 11:12:10,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:10,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:10,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:10,587 INFO L272 TraceCheckUtils]: 46: Hoare triple {16169#(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)); {15961#true} is VALID [2022-04-08 11:12:10,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {16186#(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; {16169#(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-08 11:12:10,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16186#(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-08 11:12:10,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 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; {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-08 11:12:10,595 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L272 TraceCheckUtils]: 37: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {15961#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; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-08 11:12:10,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L272 TraceCheckUtils]: 28: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {15961#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; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-08 11:12:10,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {15961#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15961#true} #63#return; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {15961#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {15961#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15961#true} {15961#true} #61#return; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#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; {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-08 11:12:10,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-08 11:12:10,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-08 11:12:10,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15961#true} is VALID [2022-04-08 11:12:10,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-08 11:12:10,598 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-08 11:12:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:10,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943018318] [2022-04-08 11:12:10,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:10,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048375280] [2022-04-08 11:12:10,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048375280] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:10,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:10,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-08 11:12:10,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205610559] [2022-04-08 11:12:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205610559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:10,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:10,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:12:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290458160] [2022-04-08 11:12:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-08 11:12:10,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:10,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:10,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:10,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:12:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:12:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:12:10,701 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:15,119 INFO L93 Difference]: Finished difference Result 163 states and 191 transitions. [2022-04-08 11:12:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:12:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-08 11:12:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-08 11:12:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-08 11:12:15,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-04-08 11:12:15,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:15,223 INFO L225 Difference]: With dead ends: 163 [2022-04-08 11:12:15,223 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 11:12:15,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 11:12:15,224 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:15,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 11:12:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 11:12:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2022-04-08 11:12:15,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:15,521 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-08 11:12:15,521 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-08 11:12:15,521 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-08 11:12:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:15,523 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-08 11:12:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-08 11:12:15,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:15,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:15,524 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-08 11:12:15,524 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-08 11:12:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:15,526 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-08 11:12:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-08 11:12:15,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:15,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:15,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:15,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:15,526 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-08 11:12:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-08 11:12:15,528 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 57 [2022-04-08 11:12:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:15,528 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-08 11:12:15,528 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:15,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-08 11:12:17,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-08 11:12:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:12:17,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:17,938 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-08 11:12:17,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:18,141 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-08 11:12:18,142 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 7 times [2022-04-08 11:12:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:18,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542318548] [2022-04-08 11:12:18,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 8 times [2022-04-08 11:12:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:18,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513216886] [2022-04-08 11:12:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:18,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:18,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287279254] [2022-04-08 11:12:18,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:12:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:18,154 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-08 11:12:18,154 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-08 11:12:18,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:12:18,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:18,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-08 11:12:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:18,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:12:18,978 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:12:28,417 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:12:45,323 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:12:47,992 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:12:48,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#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; {17219#true} is VALID [2022-04-08 11:12:48,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:12:48,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:48,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:48,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17219#true} #61#return; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:48,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:12:48,620 INFO L272 TraceCheckUtils]: 12: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:12:48,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:48,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:12:48,621 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,622 INFO L272 TraceCheckUtils]: 19: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:48,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:48,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:48,622 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,637 INFO L272 TraceCheckUtils]: 28: Hoare triple {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:48,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,639 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= 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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= 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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= 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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= 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)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~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_~Y~0 10))} is VALID [2022-04-08 11:12:48,642 INFO L272 TraceCheckUtils]: 37: Hoare triple {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~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_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:48,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,644 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~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_~Y~0 10))} #65#return; {17361#(and (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17361#(and (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* 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-08 11:12:48,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* 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; {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,646 INFO L272 TraceCheckUtils]: 46: Hoare triple {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:48,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:48,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:48,648 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:12:48,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* 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_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} is VALID [2022-04-08 11:12:48,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* 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))) (<= 4 main_~x~0))} is VALID [2022-04-08 11:12:48,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* 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))) (<= 4 main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0))} is VALID [2022-04-08 11:12:48,658 INFO L272 TraceCheckUtils]: 55: Hoare triple {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 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)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:48,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:48,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-08 11:12:48,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-08 11:12:48,659 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-08 11:12:48,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:53,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-08 11:12:53,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-08 11:12:53,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:53,316 INFO L272 TraceCheckUtils]: 55: Hoare triple {17431#(= (+ (* 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)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:53,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {17435#(= (+ (* 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; {17431#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:12:53,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {17439#(= (+ (* (* 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; {17435#(= (+ (* 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-08 11:12:53,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {17443#(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; {17439#(= (+ (* (* 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-08 11:12:53,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {17443#(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); {17443#(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-08 11:12:53,322 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17450#(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; {17443#(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-08 11:12:53,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:53,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:53,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:53,323 INFO L272 TraceCheckUtils]: 46: Hoare triple {17450#(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)); {17219#true} is VALID [2022-04-08 11:12:53,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17450#(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-08 11:12:53,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-08 11:12:53,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L272 TraceCheckUtils]: 37: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:53,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L272 TraceCheckUtils]: 28: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {17219#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17219#true} {17219#true} #63#return; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L272 TraceCheckUtils]: 12: Hoare triple {17219#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {17219#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17219#true} {17219#true} #61#return; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#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; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17219#true} is VALID [2022-04-08 11:12:53,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-08 11:12:53,328 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-08 11:12:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513216886] [2022-04-08 11:12:53,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287279254] [2022-04-08 11:12:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287279254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:53,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:53,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 32 [2022-04-08 11:12:53,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542318548] [2022-04-08 11:12:53,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542318548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:53,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:53,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 11:12:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194999283] [2022-04-08 11:12:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:12:53,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:53,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:12:53,387 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-08 11:12:53,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 11:12:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 11:12:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-04-08 11:12:53,388 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:12:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:57,371 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2022-04-08 11:12:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 11:12:57,371 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:12:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:12:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-08 11:12:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:12:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-08 11:12:57,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 84 transitions. [2022-04-08 11:12:57,525 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-08 11:12:57,527 INFO L225 Difference]: With dead ends: 153 [2022-04-08 11:12:57,527 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 11:12:57,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 11:12:57,528 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:57,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 11:12:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 11:12:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-08 11:12:57,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:57,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:57,891 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:57,891 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:57,893 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-08 11:12:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-08 11:12:57,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:57,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:57,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-08 11:12:57,893 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-08 11:12:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:57,895 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-08 11:12:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-08 11:12:57,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:57,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:57,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:57,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:12:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-08 11:12:57,897 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-08 11:12:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:57,897 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-08 11:12:57,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:12:57,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-08 11:13:00,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 143 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:13:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-08 11:13:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:13:00,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:13:00,266 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-08 11:13:00,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 11:13:00,466 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-08 11:13:00,467 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:13:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:13:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 15 times [2022-04-08 11:13:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250290063] [2022-04-08 11:13:00,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:13:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 16 times [2022-04-08 11:13:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:13:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669367441] [2022-04-08 11:13:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:13:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:13:00,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:13:00,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053223685] [2022-04-08 11:13:00,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:13:00,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:13:00,490 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-08 11:13:00,491 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-08 11:13:00,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:13:00,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:13:00,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 11:13:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:13:00,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:32,978 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:13:35,261 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:14:00,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-08 11:14:00,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18454#true} is VALID [2022-04-08 11:14:00,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:00,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-08 11:14:00,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#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; {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:00,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:00,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:00,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:00,961 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-08 11:14:00,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:00,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {18510#(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; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:00,962 INFO L272 TraceCheckUtils]: 19: Hoare triple {18510#(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)); {18454#true} is VALID [2022-04-08 11:14:00,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:00,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:00,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:00,963 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:00,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:00,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {18510#(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; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:14:00,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {18535#(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; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:14:02,968 WARN L290 TraceCheckUtils]: 27: Hoare triple {18535#(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; {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is UNKNOWN [2022-04-08 11:14:02,968 INFO L272 TraceCheckUtils]: 28: Hoare triple {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= 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)); {18454#true} is VALID [2022-04-08 11:14:02,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:02,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:02,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:02,970 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:14:02,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-08 11:14:02,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {18535#(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; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:02,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:04,975 WARN L290 TraceCheckUtils]: 36: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-08 11:14:04,975 INFO L272 TraceCheckUtils]: 37: Hoare triple {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* 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)); {18454#true} is VALID [2022-04-08 11:14:04,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:04,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:04,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:04,977 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:04,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:14:04,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,979 INFO L272 TraceCheckUtils]: 46: Hoare triple {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 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)); {18454#true} is VALID [2022-04-08 11:14:04,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:04,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:04,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:04,981 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #65#return; {18618#(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 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {18618#(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 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !!(~x~0 <= ~X~0); {18618#(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 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {18618#(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 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 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; {18625#(and (= 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))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {18625#(and (= 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))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18629#(and (= (+ (- 1) main_~y~0) 0) (= 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) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-08 11:14:04,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {18629#(and (= (+ (- 1) main_~y~0) 0) (= 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) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) 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) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-08 11:14:04,996 INFO L272 TraceCheckUtils]: 55: Hoare triple {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) 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) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 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)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:04,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:04,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-08 11:14:04,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-08 11:14:04,997 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-08 11:14:04,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:09,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-08 11:14:09,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-08 11:14:09,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:09,989 INFO L272 TraceCheckUtils]: 55: Hoare triple {18657#(= (+ (* 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)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:09,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {18661#(= (+ (* 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; {18657#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:14:09,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {18665#(= (+ (* (* 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; {18661#(= (+ (* 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-08 11:14:09,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {18661#(= (+ (* 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; {18665#(= (+ (* (* 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-08 11:14:09,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {18661#(= (+ (* 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); {18661#(= (+ (* 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-08 11:14:09,995 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18675#(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; {18661#(= (+ (* 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-08 11:14:09,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:09,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:09,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:14:09,996 INFO L272 TraceCheckUtils]: 46: Hoare triple {18675#(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)); {18454#true} is VALID [2022-04-08 11:14:09,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18675#(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-08 11:14:09,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-08 11:14:09,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-08 11:14:09,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-08 11:14:09,997 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L272 TraceCheckUtils]: 37: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L272 TraceCheckUtils]: 28: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:09,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:09,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#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; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18454#true} is VALID [2022-04-08 11:14:10,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-08 11:14:10,001 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-08 11:14:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669367441] [2022-04-08 11:14:10,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053223685] [2022-04-08 11:14:10,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053223685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:10,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:10,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-08 11:14:10,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250290063] [2022-04-08 11:14:10,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250290063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:10,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:10,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 11:14:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272211106] [2022-04-08 11:14:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:10,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:10,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:14,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:14,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 11:14:14,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 11:14:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:14:14,079 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:16,595 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-08 11:14:20,169 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-08 11:14:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:21,478 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2022-04-08 11:14:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:14:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-08 11:14:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-08 11:14:21,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-08 11:14:25,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:25,580 INFO L225 Difference]: With dead ends: 143 [2022-04-08 11:14:25,580 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 11:14:25,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:14:25,581 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:25,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 11:14:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 11:14:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2022-04-08 11:14:25,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:25,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:14:25,923 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:14:25,923 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:14:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:25,925 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-08 11:14:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-08 11:14:25,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:25,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:25,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-08 11:14:25,925 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-08 11:14:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:25,933 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-08 11:14:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-08 11:14:25,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:25,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:25,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:25,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:14:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-08 11:14:25,936 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-08 11:14:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:25,936 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-08 11:14:25,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:14:25,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-08 11:14:27,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-08 11:14:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:14:27,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:14:27,590 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-08 11:14:27,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 11:14:27,799 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-08 11:14:27,799 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:14:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:14:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 17 times [2022-04-08 11:14:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685473015] [2022-04-08 11:14:27,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:14:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 18 times [2022-04-08 11:14:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:14:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274762866] [2022-04-08 11:14:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:14:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:14:27,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:14:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872376424] [2022-04-08 11:14:27,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:14:27,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:27,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:14:27,809 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-08 11:14:27,824 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-08 11:14:27,853 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:14:27,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:14:27,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 11:14:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:14:27,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:14:43,038 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:14:49,056 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:14:49,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#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; {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:49,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:14:49,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:14:49,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:14:49,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19669#true} #61#return; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:49,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:49,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:49,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:14:49,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:14:49,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:14:49,420 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,422 INFO L272 TraceCheckUtils]: 19: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:49,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:49,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:49,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:49,423 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,425 INFO L272 TraceCheckUtils]: 28: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:49,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:49,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:49,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:49,426 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-08 11:14:49,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-08 11:14:49,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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-08 11:14:49,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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-08 11:14:49,429 INFO L272 TraceCheckUtils]: 37: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 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)); {19669#true} is VALID [2022-04-08 11:14:49,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:49,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:49,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:49,430 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} #65#return; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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-08 11:14:49,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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); {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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-08 11:14:49,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 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 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} is VALID [2022-04-08 11:14:49,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-08 11:14:49,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= 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-08 11:14:49,433 INFO L272 TraceCheckUtils]: 46: Hoare triple {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= 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)); {19669#true} is VALID [2022-04-08 11:14:49,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:49,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:49,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:49,435 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 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_~X~0) (<= main_~x~0 3))} is VALID [2022-04-08 11:14:49,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 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_~X~0) (<= main_~x~0 3))} assume !!(~x~0 <= ~X~0); {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 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_~X~0) (<= main_~x~0 3))} is VALID [2022-04-08 11:14:49,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 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_~X~0) (<= main_~x~0 3))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* 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-08 11:14:49,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* 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; {19849#(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_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-08 11:14:49,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {19849#(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_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19853#(and (= (+ (* 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_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (mod main_~yx~0 main_~Y~0) 0))} is VALID [2022-04-08 11:14:49,446 INFO L272 TraceCheckUtils]: 55: Hoare triple {19853#(and (= (+ (* 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_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (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)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:49,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:49,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-08 11:14:49,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-08 11:14:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 11:14:49,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:54,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-08 11:14:54,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-08 11:14:54,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:54,917 INFO L272 TraceCheckUtils]: 55: Hoare triple {19877#(= (+ (* 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)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:54,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {19881#(= (+ (* 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; {19877#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:14:54,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {19885#(= (+ (* (* 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; {19881#(= (+ (* 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-08 11:14:54,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {19881#(= (+ (* 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; {19885#(= (+ (* (* 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-08 11:14:54,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {19881#(= (+ (* 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); {19881#(= (+ (* 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-08 11:14:54,922 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19895#(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; {19881#(= (+ (* 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-08 11:14:54,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:54,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:54,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:14:54,923 INFO L272 TraceCheckUtils]: 46: Hoare triple {19895#(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)); {19669#true} is VALID [2022-04-08 11:14:54,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19895#(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-08 11:14:54,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {19669#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; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L272 TraceCheckUtils]: 37: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L272 TraceCheckUtils]: 28: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {19669#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19669#true} {19669#true} #63#return; {19669#true} is VALID [2022-04-08 11:14:54,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L272 TraceCheckUtils]: 12: Hoare triple {19669#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {19669#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19669#true} {19669#true} #61#return; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#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; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-08 11:14:54,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19669#true} is VALID [2022-04-08 11:14:54,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-08 11:14:54,928 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-08 11:14:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:54,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274762866] [2022-04-08 11:14:54,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:54,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872376424] [2022-04-08 11:14:54,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872376424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:54,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:54,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-08 11:14:54,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:54,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685473015] [2022-04-08 11:14:54,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685473015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:54,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:54,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 11:14:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193830486] [2022-04-08 11:14:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:14:54,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:54,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:14:54,988 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-08 11:14:54,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 11:14:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 11:14:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:14:54,989 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:14:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:59,407 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2022-04-08 11:14:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 11:14:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:14:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:14:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-08 11:14:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:14:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-08 11:14:59,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 76 transitions. [2022-04-08 11:14:59,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:59,521 INFO L225 Difference]: With dead ends: 162 [2022-04-08 11:14:59,521 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 11:14:59,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 11:14:59,522 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:59,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 11:14:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 11:14:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-04-08 11:14:59,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:59,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:14:59,912 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:14:59,912 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:14:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:59,915 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-08 11:14:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-08 11:14:59,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:59,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:59,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-08 11:14:59,916 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-08 11:14:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:59,919 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-08 11:14:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-08 11:14:59,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:59,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:59,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:59,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 11:14:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-04-08 11:14:59,922 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 59 [2022-04-08 11:14:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:59,922 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-04-08 11:14:59,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:14:59,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 157 transitions. [2022-04-08 11:15:02,354 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-08 11:15:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-04-08 11:15:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:15:02,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:15:02,354 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-08 11:15:02,370 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-08 11:15:02,555 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-08 11:15:02,555 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:15:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:15:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 19 times [2022-04-08 11:15:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:15:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685836367] [2022-04-08 11:15:02,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:15:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 20 times [2022-04-08 11:15:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:15:02,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327003433] [2022-04-08 11:15:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:15:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:15:02,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:15:02,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721074007] [2022-04-08 11:15:02,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:15:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:15:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:15:02,568 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-08 11:15:02,568 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-08 11:15:02,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:15:02,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:15:02,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-08 11:15:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:15:02,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:15:27,742 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:15:28,623 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:15:47,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#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; {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:47,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-08 11:15:47,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:15:47,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {21021#(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; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:15:47,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {21021#(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)); {20965#true} is VALID [2022-04-08 11:15:47,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:47,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:47,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:47,114 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:15:47,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:15:47,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {21021#(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; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:15:47,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {21046#(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; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:15:49,119 WARN L290 TraceCheckUtils]: 27: Hoare triple {21046#(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; {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-08 11:15:49,119 INFO L272 TraceCheckUtils]: 28: Hoare triple {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* 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)); {20965#true} is VALID [2022-04-08 11:15:49,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:49,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:49,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:49,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:15:49,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:15:49,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {21046#(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 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21077#(and (= (+ 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-08 11:15:49,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21077#(and (= (+ 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-08 11:15:51,126 WARN L290 TraceCheckUtils]: 36: Hoare triple {21077#(and (= (+ 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; {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} is UNKNOWN [2022-04-08 11:15:51,126 INFO L272 TraceCheckUtils]: 37: Hoare triple {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~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)); {20965#true} is VALID [2022-04-08 11:15:51,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:51,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:51,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:51,128 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} #65#return; {21077#(and (= (+ 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-08 11:15:51,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {21077#(and (= (+ 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-08 11:15:51,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21106#(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-08 11:15:51,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {21106#(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; {21106#(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-08 11:15:51,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {21106#(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; {21113#(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-08 11:15:51,129 INFO L272 TraceCheckUtils]: 46: Hoare triple {21113#(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)); {20965#true} is VALID [2022-04-08 11:15:51,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:51,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:51,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:51,131 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21113#(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; {21129#(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-08 11:15:51,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {21129#(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); {21129#(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-08 11:15:51,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {21129#(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; {21136#(and (= 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 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-08 11:15:51,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {21136#(and (= 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 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~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; {21140#(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 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-08 11:15:51,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {21140#(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 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 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; {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 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) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-08 11:15:51,144 INFO L272 TraceCheckUtils]: 55: Hoare triple {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 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) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= 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)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:15:51,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:51,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-08 11:15:51,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-08 11:15:51,145 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-08 11:15:51,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:15:55,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-08 11:15:55,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-08 11:15:55,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:55,899 INFO L272 TraceCheckUtils]: 55: Hoare triple {21168#(= (+ (* 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)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:15:55,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {21172#(= (+ (* 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; {21168#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:15:55,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {21176#(= (+ (* (* 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; {21172#(= (+ (* 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-08 11:15:55,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {21172#(= (+ (* 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; {21176#(= (+ (* (* 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-08 11:15:55,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {21172#(= (+ (* 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); {21172#(= (+ (* 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-08 11:15:55,931 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21186#(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; {21172#(= (+ (* 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-08 11:15:55,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:55,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:55,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:15:55,932 INFO L272 TraceCheckUtils]: 46: Hoare triple {21186#(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)); {20965#true} is VALID [2022-04-08 11:15:55,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21186#(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-08 11:15:55,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-08 11:15:55,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-08 11:15:55,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L272 TraceCheckUtils]: 37: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {20965#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; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:55,934 INFO L272 TraceCheckUtils]: 28: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#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; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20965#true} is VALID [2022-04-08 11:15:55,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-08 11:15:55,937 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-08 11:15:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:15:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327003433] [2022-04-08 11:15:55,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:15:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721074007] [2022-04-08 11:15:55,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721074007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:15:55,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:15:55,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-08 11:15:55,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:15:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685836367] [2022-04-08 11:15:55,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685836367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:15:55,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:15:55,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 11:15:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316344531] [2022-04-08 11:15:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:15:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:15:55,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:15:55,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:00,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:16:00,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 11:16:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:16:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 11:16:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:16:00,032 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:02,800 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-08 11:16:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:06,595 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-04-08 11:16:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 11:16:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:16:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-08 11:16:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-08 11:16:06,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-08 11:16:10,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:16:10,723 INFO L225 Difference]: With dead ends: 157 [2022-04-08 11:16:10,723 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 11:16:10,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:16:10,724 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:16:10,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 230 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 11:16:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 11:16:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2022-04-08 11:16:11,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:16:11,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:11,148 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:11,148 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:11,150 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-08 11:16:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-08 11:16:11,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:16:11,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:16:11,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-08 11:16:11,151 INFO L87 Difference]: Start difference. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-08 11:16:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:11,153 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-08 11:16:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-08 11:16:11,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:16:11,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:16:11,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:16:11,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:16:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2022-04-08 11:16:11,156 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 59 [2022-04-08 11:16:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:16:11,156 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2022-04-08 11:16:11,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 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-08 11:16:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 167 transitions. [2022-04-08 11:16:13,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:16:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2022-04-08 11:16:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:16:13,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:16:13,976 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-08 11:16:13,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 11:16:14,191 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-08 11:16:14,191 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:16:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:16:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 21 times [2022-04-08 11:16:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:16:14,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507644271] [2022-04-08 11:16:14,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:16:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 22 times [2022-04-08 11:16:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:16:14,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013426495] [2022-04-08 11:16:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:16:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:16:14,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:16:14,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052111575] [2022-04-08 11:16:14,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:16:14,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:16:14,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:16:14,202 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-08 11:16:14,203 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-08 11:16:14,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:16:14,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:16:14,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-08 11:16:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:16:14,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:16:14,649 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:21,968 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:26,211 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:30,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#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; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:30,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:30,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:30,812 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-08 11:16:30,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:16:30,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {22334#(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; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:16:30,813 INFO L272 TraceCheckUtils]: 19: Hoare triple {22334#(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)); {22278#true} is VALID [2022-04-08 11:16:30,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:30,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:30,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:30,813 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:16:30,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {22334#(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); {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:16:30,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {22334#(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; {22359#(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-08 11:16:30,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {22359#(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; {22363#(and (<= 1 main_~x~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-08 11:16:30,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {22363#(and (<= 1 main_~x~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))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22367#(and (<= 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)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:16:30,816 INFO L272 TraceCheckUtils]: 28: Hoare triple {22367#(and (<= 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)) (= (+ (* (- 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)); {22278#true} is VALID [2022-04-08 11:16:30,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:30,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,819 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22367#(and (<= 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)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {22385#(and (<= 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) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:16:30,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {22385#(and (<= 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) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {22385#(and (<= 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) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:16:30,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {22385#(and (<= 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) (= (+ (* (- 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; {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:16:30,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-08 11:16:30,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 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)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-08 11:16:30,824 INFO L272 TraceCheckUtils]: 37: Hoare triple {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 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)) (<= (+ (div main_~Y~0 main_~Y~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)); {22278#true} is VALID [2022-04-08 11:16:30,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:30,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,827 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 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)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} #65#return; {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)))} is VALID [2022-04-08 11:16:30,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)))} assume !!(~x~0 <= ~X~0); {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)))} is VALID [2022-04-08 11:16:30,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~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) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-08 11:16:30,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~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) (* (- 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; {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-08 11:16:30,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= 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; {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= 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-08 11:16:30,833 INFO L272 TraceCheckUtils]: 46: Hoare triple {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= 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)); {22278#true} is VALID [2022-04-08 11:16:30,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:30,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:30,837 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= 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; {22447#(and (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-08 11:16:30,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} assume !!(~x~0 <= ~X~0); {22447#(and (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-08 11:16:30,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= 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_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* 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; {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-08 11:16:30,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} is VALID [2022-04-08 11:16:30,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22462#(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) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0))} is VALID [2022-04-08 11:16:30,845 INFO L272 TraceCheckUtils]: 55: Hoare triple {22462#(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) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) 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)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:16:30,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:30,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-08 11:16:30,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-08 11:16:30,846 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-08 11:16:30,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:16:32,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-08 11:16:32,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-08 11:16:32,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:32,918 INFO L272 TraceCheckUtils]: 55: Hoare triple {22486#(= (+ (* 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)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:16:32,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {22490#(= (+ (* 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; {22486#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:16:32,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {22494#(= (+ (* (* 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; {22490#(= (+ (* 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-08 11:16:32,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {22490#(= (+ (* 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; {22494#(= (+ (* (* 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-08 11:16:32,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {22490#(= (+ (* 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); {22490#(= (+ (* 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-08 11:16:32,927 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22504#(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; {22490#(= (+ (* 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-08 11:16:32,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:32,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:32,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:16:32,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {22504#(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)); {22278#true} is VALID [2022-04-08 11:16:32,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22504#(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-08 11:16:32,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-08 11:16:32,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-08 11:16:32,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-08 11:16:32,929 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L272 TraceCheckUtils]: 37: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {22278#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; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L272 TraceCheckUtils]: 28: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-08 11:16:32,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:32,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#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; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22278#true} is VALID [2022-04-08 11:16:32,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-08 11:16:32,933 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-08 11:16:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:16:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013426495] [2022-04-08 11:16:32,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:16:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052111575] [2022-04-08 11:16:32,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052111575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:16:32,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:16:32,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-08 11:16:32,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:16:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507644271] [2022-04-08 11:16:32,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507644271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:16:32,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:16:32,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 11:16:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327588823] [2022-04-08 11:16:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:16:32,934 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:32,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:16:32,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:33,026 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-08 11:16:33,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 11:16:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:16:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 11:16:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:16:33,027 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:37,055 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-04-08 11:16:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 11:16:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:16:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-08 11:16:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-08 11:16:37,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2022-04-08 11:16:37,176 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-08 11:16:37,178 INFO L225 Difference]: With dead ends: 168 [2022-04-08 11:16:37,178 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 11:16:37,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 11:16:37,179 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 11:16:37,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 269 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 11:16:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 11:16:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-04-08 11:16:37,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:16:37,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:37,613 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:37,613 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:37,615 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-08 11:16:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-08 11:16:37,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:16:37,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:16:37,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-08 11:16:37,616 INFO L87 Difference]: Start difference. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-08 11:16:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:16:37,618 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-08 11:16:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-08 11:16:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:16:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:16:37,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:16:37,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:16:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 11:16:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2022-04-08 11:16:37,621 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 59 [2022-04-08 11:16:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:16:37,621 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2022-04-08 11:16:37,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 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-08 11:16:37,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 170 transitions. [2022-04-08 11:16:40,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:16:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2022-04-08 11:16:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:16:40,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:16:40,457 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-08 11:16:40,497 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-08 11:16:40,670 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-08 11:16:40,670 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:16:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:16:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 23 times [2022-04-08 11:16:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:16:40,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820641999] [2022-04-08 11:16:40,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:16:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 24 times [2022-04-08 11:16:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:16:40,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199442085] [2022-04-08 11:16:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:16:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:16:40,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:16:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319705743] [2022-04-08 11:16:40,683 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:16:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:16:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:16:40,684 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-08 11:16:40,686 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-08 11:16:40,743 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:16:40,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:16:40,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-08 11:16:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:16:40,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:16:54,829 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:55,361 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:17:18,979 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful