/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:29:43,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:29:43,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:29:43,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:29:43,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:29:43,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:29:43,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:29:43,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:29:43,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:29:43,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:29:43,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:29:43,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:29:43,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:29:43,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:29:43,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:29:43,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:29:43,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:29:43,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:29:43,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:29:43,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:29:43,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:29:43,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:29:43,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:29:43,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:29:43,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:29:43,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:29:43,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:29:43,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:29:43,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:29:43,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:29:43,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:29:43,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:29:43,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:29:43,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:29:43,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:29:43,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:29:43,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:29:43,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:29:43,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:29:43,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:29:43,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:29:43,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:29:43,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:29:43,163 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:29:43,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:29:43,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:29:43,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:29:43,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:29:43,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:29:43,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:29:43,167 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:29:43,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:29:43,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:29:43,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:29:43,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:29:43,385 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:29:43,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c [2022-04-28 05:29:43,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45596ba80/4e455ff5f1434da0b2328d14e7b0a3e2/FLAG656021ddd [2022-04-28 05:29:43,778 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:29:43,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound10.c [2022-04-28 05:29:43,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45596ba80/4e455ff5f1434da0b2328d14e7b0a3e2/FLAG656021ddd [2022-04-28 05:29:44,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45596ba80/4e455ff5f1434da0b2328d14e7b0a3e2 [2022-04-28 05:29:44,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:29:44,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:29:44,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:29:44,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:29:44,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:29:44,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31edb671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44, skipping insertion in model container [2022-04-28 05:29:44,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:29:44,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:29:44,382 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/egcd-ll_valuebound10.c[489,502] [2022-04-28 05:29:44,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:29:44,413 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:29:44,424 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/egcd-ll_valuebound10.c[489,502] [2022-04-28 05:29:44,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:29:44,454 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:29:44,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44 WrapperNode [2022-04-28 05:29:44,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:29:44,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:29:44,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:29:44,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:29:44,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:29:44,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:29:44,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:29:44,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:29:44,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (1/1) ... [2022-04-28 05:29:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:29:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:44,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:29:44,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:29:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:29:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:29:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:29:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:29:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:29:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:29:44,605 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:29:44,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:29:44,778 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:29:44,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:29:44,783 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 05:29:44,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:29:44 BoogieIcfgContainer [2022-04-28 05:29:44,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:29:44,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:29:44,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:29:44,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:29:44,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:29:44" (1/3) ... [2022-04-28 05:29:44,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6914bfde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:29:44, skipping insertion in model container [2022-04-28 05:29:44,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:29:44" (2/3) ... [2022-04-28 05:29:44,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6914bfde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:29:44, skipping insertion in model container [2022-04-28 05:29:44,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:29:44" (3/3) ... [2022-04-28 05:29:44,799 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound10.c [2022-04-28 05:29:44,808 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:29:44,808 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:29:44,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:29:44,856 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18d277b1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ea2960b [2022-04-28 05:29:44,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:29:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 05:29:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 05:29:44,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:44,876 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:44,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times [2022-04-28 05:29:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716837170] [2022-04-28 05:29:44,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 2 times [2022-04-28 05:29:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:44,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129955930] [2022-04-28 05:29:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:29:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 05:29:45,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:29:45,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-28 05:29:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:29:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-28 05:29:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 05:29:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-28 05:29:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 05:29:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-28 05:29:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 05:29:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-28 05:29:45,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:29:45,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-28 05:29:45,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:29:45,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-28 05:29:45,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-28 05:29:45,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-28 05:29:45,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {40#true} is VALID [2022-04-28 05:29:45,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-28 05:29:45,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-28 05:29:45,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {40#true} is VALID [2022-04-28 05:29:45,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,126 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-28 05:29:45,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 05:29:45,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,127 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-28 05:29:45,127 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 05:29:45,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:29:45,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:29:45,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:29:45,128 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-28 05:29:45,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41#false} is VALID [2022-04-28 05:29:45,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-28 05:29:45,129 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {41#false} is VALID [2022-04-28 05:29:45,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 05:29:45,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 05:29:45,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 05:29:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:29:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:29:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129955930] [2022-04-28 05:29:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129955930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:45,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:45,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:29:45,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:29:45,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716837170] [2022-04-28 05:29:45,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716837170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:45,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:45,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:29:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936693754] [2022-04-28 05:29:45,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:29:45,136 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:29:45,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:29:45,139 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:29:45,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:29:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:29:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:29:45,203 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:29:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:45,361 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-28 05:29:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:29:45,361 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:29:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:29:45,362 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:29:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-28 05:29:45,373 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:29:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-28 05:29:45,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-28 05:29:45,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:45,495 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:29:45,496 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 05:29:45,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:29:45,500 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:29:45,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:29:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 05:29:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 05:29:45,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:29:45,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:29:45,523 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:29:45,523 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:29:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:45,527 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 05:29:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 05:29:45,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:45,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:45,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 05:29:45,529 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-28 05:29:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:45,539 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-28 05:29:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 05:29:45,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:45,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:45,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:29:45,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:29:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:29:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 05:29:45,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-28 05:29:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:29:45,545 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 05:29:45,545 INFO L496 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:29:45,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 05:29:45,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 05:29:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 05:29:45,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:45,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:45,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:29:45,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times [2022-04-28 05:29:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:45,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986512445] [2022-04-28 05:29:45,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 2 times [2022-04-28 05:29:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:45,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473553173] [2022-04-28 05:29:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:45,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:29:45,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233411609] [2022-04-28 05:29:45,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:29:45,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:29:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:45,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:29:45,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:29:45,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:29:45,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:29:45,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:29:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:45,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:29:48,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-28 05:29:48,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-28 05:29:48,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 05:29:48,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #88#return; {326#true} is VALID [2022-04-28 05:29:48,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-28 05:29:48,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {326#true} is VALID [2022-04-28 05:29:48,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {326#true} is VALID [2022-04-28 05:29:48,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 05:29:48,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 05:29:48,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 05:29:48,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #66#return; {326#true} is VALID [2022-04-28 05:29:48,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {326#true} is VALID [2022-04-28 05:29:48,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {326#true} is VALID [2022-04-28 05:29:48,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 05:29:48,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 05:29:48,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 05:29:48,459 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {326#true} {326#true} #68#return; {326#true} is VALID [2022-04-28 05:29:48,460 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-28 05:29:48,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 05:29:48,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 05:29:48,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 05:29:48,460 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {326#true} #70#return; {326#true} is VALID [2022-04-28 05:29:48,460 INFO L272 TraceCheckUtils]: 22: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-28 05:29:48,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-28 05:29:48,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-28 05:29:48,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 05:29:48,461 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {326#true} #72#return; {326#true} is VALID [2022-04-28 05:29:48,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {326#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-28 05:29:48,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-28 05:29:48,463 INFO L272 TraceCheckUtils]: 29: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:29:48,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:29:48,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-28 05:29:48,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-28 05:29:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:29:48,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:29:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:29:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473553173] [2022-04-28 05:29:48,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:29:48,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233411609] [2022-04-28 05:29:48,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233411609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:48,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:48,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:48,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:29:48,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986512445] [2022-04-28 05:29:48,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986512445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:48,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493988861] [2022-04-28 05:29:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:29:48,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-28 05:29:48,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:29:48,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:29:48,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:48,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:29:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:29:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:29:48,510 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:29:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:48,704 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-28 05:29:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:29:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-28 05:29:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:29:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:29:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:29:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:48,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:29:48,764 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-28 05:29:48,766 INFO L225 Difference]: With dead ends: 48 [2022-04-28 05:29:48,766 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 05:29:48,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:29:48,767 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:29:48,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:29:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 05:29:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-28 05:29:48,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:29:48,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:48,778 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:48,778 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:48,781 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-28 05:29:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-28 05:29:48,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:48,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-28 05:29:48,783 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-28 05:29:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:48,789 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-28 05:29:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-28 05:29:48,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:48,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:48,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:29:48,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:29:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-28 05:29:48,792 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-28 05:29:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:29:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-28 05:29:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:29:48,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 62 transitions. [2022-04-28 05:29:48,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 05:29:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 05:29:48,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:48,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:48,877 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-28 05:29:49,079 WARN L477 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-28 05:29:49,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times [2022-04-28 05:29:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233433531] [2022-04-28 05:29:49,081 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 2 times [2022-04-28 05:29:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411485096] [2022-04-28 05:29:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:49,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:29:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616190855] [2022-04-28 05:29:49,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:29:49,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:29:49,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:49,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:29:49,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:29:49,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:29:49,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:29:49,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:29:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:49,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:29:53,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2022-04-28 05:29:53,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {709#true} is VALID [2022-04-28 05:29:53,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #88#return; {709#true} is VALID [2022-04-28 05:29:53,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret6 := main(); {709#true} is VALID [2022-04-28 05:29:53,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {709#true} is VALID [2022-04-28 05:29:53,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {709#true} {709#true} #66#return; {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {709#true} is VALID [2022-04-28 05:29:53,327 INFO L272 TraceCheckUtils]: 12: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-28 05:29:53,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {709#true} {709#true} #68#return; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L272 TraceCheckUtils]: 17: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-28 05:29:53,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-28 05:29:53,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {709#true} {709#true} #70#return; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L272 TraceCheckUtils]: 22: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-28 05:29:53,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-28 05:29:53,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-28 05:29:53,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,329 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {709#true} {709#true} #72#return; {709#true} is VALID [2022-04-28 05:29:53,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {709#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:29:53,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:29:53,332 INFO L272 TraceCheckUtils]: 29: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {709#true} is VALID [2022-04-28 05:29:53,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-28 05:29:53,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-28 05:29:53,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-28 05:29:53,333 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {709#true} {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:29:53,333 INFO L272 TraceCheckUtils]: 34: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:29:53,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:29:53,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {710#false} is VALID [2022-04-28 05:29:53,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {710#false} assume !false; {710#false} is VALID [2022-04-28 05:29:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:29:53,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:29:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:29:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411485096] [2022-04-28 05:29:53,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:29:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616190855] [2022-04-28 05:29:53,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616190855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:53,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:53,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:53,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:29:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233433531] [2022-04-28 05:29:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233433531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:53,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:53,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897533187] [2022-04-28 05:29:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:29:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-28 05:29:53,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:29:53,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:29:53,357 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-28 05:29:53,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:29:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:29:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:29:53,358 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:29:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:53,590 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-28 05:29:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:29:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-28 05:29:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:29:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:29:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:29:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:53,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:29:53,644 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-28 05:29:53,645 INFO L225 Difference]: With dead ends: 52 [2022-04-28 05:29:53,645 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 05:29:53,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:29:53,646 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:29:53,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:29:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 05:29:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-28 05:29:53,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:29:53,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:53,680 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:53,680 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:53,684 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 05:29:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 05:29:53,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:53,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:53,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-28 05:29:53,685 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-28 05:29:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:53,687 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 05:29:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 05:29:53,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:53,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:53,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:29:53,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:29:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 05:29:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-28 05:29:53,690 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-28 05:29:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:29:53,690 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-28 05:29:53,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:29:53,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-28 05:29:53,754 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-28 05:29:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 05:29:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:29:53,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:53,755 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:53,776 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-28 05:29:53,971 WARN L477 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-28 05:29:53,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times [2022-04-28 05:29:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651414270] [2022-04-28 05:29:53,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 2 times [2022-04-28 05:29:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:53,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582184977] [2022-04-28 05:29:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:53,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:29:53,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197598359] [2022-04-28 05:29:53,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:29:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:29:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:53,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:29:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:29:54,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:29:54,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:29:54,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:29:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:54,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:29:56,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} call ULTIMATE.init(); {1131#true} is VALID [2022-04-28 05:29:56,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1131#true} is VALID [2022-04-28 05:29:56,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} #88#return; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} call #t~ret6 := main(); {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} #66#return; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1131#true} is VALID [2022-04-28 05:29:56,204 INFO L272 TraceCheckUtils]: 12: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1131#true} {1131#true} #68#return; {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L272 TraceCheckUtils]: 17: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,205 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1131#true} {1131#true} #70#return; {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1131#true} {1131#true} #72#return; {1131#true} is VALID [2022-04-28 05:29:56,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:29:56,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:29:56,207 INFO L272 TraceCheckUtils]: 29: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,208 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:29:56,208 INFO L272 TraceCheckUtils]: 34: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1131#true} is VALID [2022-04-28 05:29:56,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-28 05:29:56,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-28 05:29:56,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-28 05:29:56,209 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:29:56,210 INFO L272 TraceCheckUtils]: 39: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:29:56,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:29:56,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {1258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1132#false} is VALID [2022-04-28 05:29:56,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {1132#false} assume !false; {1132#false} is VALID [2022-04-28 05:29:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:29:56,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:29:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:29:56,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582184977] [2022-04-28 05:29:56,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:29:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197598359] [2022-04-28 05:29:56,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197598359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:56,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:56,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:56,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:29:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651414270] [2022-04-28 05:29:56,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651414270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:56,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:56,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478274602] [2022-04-28 05:29:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:29:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 05:29:56,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:29:56,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:29:56,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:56,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:29:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:29:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:29:56,238 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:29:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:56,438 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-28 05:29:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:29:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 05:29:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:29:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:29:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:29:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:29:56,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:29:56,489 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-28 05:29:56,492 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:29:56,492 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 05:29:56,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:29:56,494 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:29:56,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:29:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 05:29:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 05:29:56,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:29:56,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:56,524 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:56,526 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:56,530 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-28 05:29:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-28 05:29:56,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:56,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:56,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-28 05:29:56,533 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-28 05:29:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:56,536 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-28 05:29:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-28 05:29:56,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:56,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:56,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:29:56,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:29:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-28 05:29:56,542 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-28 05:29:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:29:56,543 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-28 05:29:56,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:29:56,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 98 transitions. [2022-04-28 05:29:56,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-28 05:29:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 05:29:56,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:56,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:56,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:29:56,845 WARN L477 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-28 05:29:56,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times [2022-04-28 05:29:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:56,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715857127] [2022-04-28 05:29:56,846 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 2 times [2022-04-28 05:29:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:56,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433825772] [2022-04-28 05:29:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:56,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:29:56,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016824586] [2022-04-28 05:29:56,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:29:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:29:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:56,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:29:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:29:56,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:29:56,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:29:56,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:29:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:56,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:29:57,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1694#true} call ULTIMATE.init(); {1694#true} is VALID [2022-04-28 05:29:57,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1694#true} is VALID [2022-04-28 05:29:57,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1694#true} {1694#true} #88#return; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1694#true} call #t~ret6 := main(); {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {1694#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1694#true} {1694#true} #66#return; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1694#true} {1694#true} #68#return; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1694#true} {1694#true} #70#return; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L272 TraceCheckUtils]: 22: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1694#true} {1694#true} #72#return; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {1694#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {1694#true} assume !false; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L272 TraceCheckUtils]: 29: Hoare triple {1694#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1694#true} {1694#true} #74#return; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L272 TraceCheckUtils]: 34: Hoare triple {1694#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1694#true} {1694#true} #76#return; {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L272 TraceCheckUtils]: 39: Hoare triple {1694#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-28 05:29:57,018 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1694#true} {1694#true} #78#return; {1694#true} is VALID [2022-04-28 05:29:57,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {1694#true} assume !(~a~0 != ~b~0); {1831#(= main_~b~0 main_~a~0)} is VALID [2022-04-28 05:29:57,024 INFO L272 TraceCheckUtils]: 45: Hoare triple {1831#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:29:57,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:29:57,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {1839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1695#false} is VALID [2022-04-28 05:29:57,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {1695#false} assume !false; {1695#false} is VALID [2022-04-28 05:29:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 05:29:57,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:29:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:29:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433825772] [2022-04-28 05:29:57,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:29:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016824586] [2022-04-28 05:29:57,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016824586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:57,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:57,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:57,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:29:57,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715857127] [2022-04-28 05:29:57,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715857127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:29:57,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:29:57,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:29:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304781686] [2022-04-28 05:29:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:29:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-28 05:29:57,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:29:57,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-28 05:29:57,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:57,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:29:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:29:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:29:57,048 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-28 05:29:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:57,185 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-28 05:29:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:29:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-28 05:29:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:29:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-28 05:29:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 05:29:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-28 05:29:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 05:29:57,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 05:29:57,211 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-28 05:29:57,213 INFO L225 Difference]: With dead ends: 76 [2022-04-28 05:29:57,213 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 05:29:57,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:29:57,214 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:29:57,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:29:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 05:29:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 05:29:57,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:29:57,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:57,232 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:57,233 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:57,235 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-28 05:29:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-28 05:29:57,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:57,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:57,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-28 05:29:57,236 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-28 05:29:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:29:57,238 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-28 05:29:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-28 05:29:57,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:29:57,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:29:57,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:29:57,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:29:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:29:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-28 05:29:57,242 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-28 05:29:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:29:57,242 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-28 05:29:57,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-28 05:29:57,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 101 transitions. [2022-04-28 05:29:57,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:29:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-28 05:29:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:29:57,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:29:57,350 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:29:57,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 05:29:57,559 WARN L477 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-28 05:29:57,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:29:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:29:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times [2022-04-28 05:29:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:29:57,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5747728] [2022-04-28 05:29:57,561 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:29:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 2 times [2022-04-28 05:29:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:29:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113157837] [2022-04-28 05:29:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:29:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:29:57,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:29:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776791453] [2022-04-28 05:29:57,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:29:57,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:29:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:29:57,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:29:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:29:57,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:29:57,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:29:57,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:29:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:29:57,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:01,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret6 := main(); {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {2295#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2295#true} is VALID [2022-04-28 05:30:01,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2295#true} {2295#true} #66#return; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {2295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2295#true} {2295#true} #68#return; {2295#true} is VALID [2022-04-28 05:30:01,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2295#true} {2295#true} #70#return; {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L272 TraceCheckUtils]: 22: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,803 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2295#true} {2295#true} #72#return; {2295#true} is VALID [2022-04-28 05:30:01,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {2295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,808 INFO L272 TraceCheckUtils]: 29: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,809 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,809 INFO L272 TraceCheckUtils]: 34: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,811 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,811 INFO L272 TraceCheckUtils]: 39: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2295#true} is VALID [2022-04-28 05:30:01,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-28 05:30:01,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-28 05:30:01,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-28 05:30:01,821 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:01,823 INFO L272 TraceCheckUtils]: 47: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:01,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:01,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {2446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2296#false} is VALID [2022-04-28 05:30:01,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2022-04-28 05:30:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 05:30:01,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:30:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:30:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113157837] [2022-04-28 05:30:01,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:30:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776791453] [2022-04-28 05:30:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776791453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:30:01,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:30:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5747728] [2022-04-28 05:30:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5747728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:30:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117799445] [2022-04-28 05:30:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:30:01,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:30:01,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:30:01,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:01,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:01,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:30:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:30:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:30:01,851 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:02,011 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-28 05:30:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:30:02,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:30:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:30:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 05:30:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 05:30:02,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 05:30:02,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:02,061 INFO L225 Difference]: With dead ends: 84 [2022-04-28 05:30:02,061 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 05:30:02,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:30:02,061 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:30:02,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:30:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 05:30:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-28 05:30:02,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:30:02,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:30:02,089 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:30:02,089 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:30:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:02,093 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-28 05:30:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-28 05:30:02,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:02,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:02,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-28 05:30:02,093 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-28 05:30:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:02,096 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-28 05:30:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-28 05:30:02,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:02,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:02,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:30:02,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:30:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:30:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-28 05:30:02,099 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-28 05:30:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:30:02,099 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-28 05:30:02,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:02,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 102 transitions. [2022-04-28 05:30:02,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-28 05:30:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 05:30:02,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:30:02,203 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:30:02,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:30:02,423 WARN L477 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-28 05:30:02,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:30:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:30:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times [2022-04-28 05:30:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362201112] [2022-04-28 05:30:02,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:30:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 2 times [2022-04-28 05:30:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:30:02,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928622332] [2022-04-28 05:30:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:30:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:30:02,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:30:02,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987227] [2022-04-28 05:30:02,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:30:02,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:30:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:30:02,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:30:02,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:30:02,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:30:02,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:30:02,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:30:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:30:02,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:02,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:02,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:02,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:02,637 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:02,637 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,643 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:02,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:02,644 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:02,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:02,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:02,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:02,644 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:02,645 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:02,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:02,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-28 05:30:02,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-28 05:30:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:30:02,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:30:18,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-28 05:30:18,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-28 05:30:18,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:18,965 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:18,965 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:18,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,966 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:18,967 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:18,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,967 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,967 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:18,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:18,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:18,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:30:18,968 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,968 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-28 05:30:18,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,969 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-28 05:30:18,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-28 05:30:18,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-28 05:30:18,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-28 05:30:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:30:18,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:30:18,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928622332] [2022-04-28 05:30:18,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:30:18,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987227] [2022-04-28 05:30:18,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:30:18,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:30:18,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:30:18,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:30:18,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [362201112] [2022-04-28 05:30:18,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [362201112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:18,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:18,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:30:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379647335] [2022-04-28 05:30:18,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:30:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 05:30:18,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:30:18,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:18,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:18,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:30:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:30:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:30:19,000 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:19,354 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-28 05:30:19,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:30:19,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 05:30:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:30:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 05:30:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-28 05:30:19,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-28 05:30:19,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:19,393 INFO L225 Difference]: With dead ends: 88 [2022-04-28 05:30:19,393 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 05:30:19,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:30:19,394 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:30:19,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 129 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:30:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 05:30:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 05:30:19,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:30:19,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 05:30:19,420 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 05:30:19,420 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 05:30:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:19,422 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-28 05:30:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-28 05:30:19,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:19,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:19,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-28 05:30:19,423 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-28 05:30:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:19,425 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-28 05:30:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-28 05:30:19,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:19,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:19,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:30:19,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:30:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 05:30:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-28 05:30:19,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-28 05:30:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:30:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-28 05:30:19,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:19,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 105 transitions. [2022-04-28 05:30:19,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-28 05:30:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 05:30:19,539 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:30:19,539 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:30:19,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:30:19,747 WARN L477 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-28 05:30:19,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:30:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:30:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 3 times [2022-04-28 05:30:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:19,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885223695] [2022-04-28 05:30:19,748 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:30:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 4 times [2022-04-28 05:30:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:30:19,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255237328] [2022-04-28 05:30:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:30:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:30:19,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:30:19,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936802088] [2022-04-28 05:30:19,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:30:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:30:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:30:19,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:30:19,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:30:19,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:30:19,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:30:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 05:30:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:30:19,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:20,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-28 05:30:20,192 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:30:20,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:30:20,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:30:20,194 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} {3792#true} #72#return; {3877#(<= 1 main_~y~0)} is VALID [2022-04-28 05:30:20,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {3877#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,195 INFO L272 TraceCheckUtils]: 29: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,196 INFO L272 TraceCheckUtils]: 34: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,197 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,197 INFO L272 TraceCheckUtils]: 39: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,198 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:20,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {3881#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-28 05:30:20,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} assume !false; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-28 05:30:20,199 INFO L272 TraceCheckUtils]: 47: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,200 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} #74#return; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-28 05:30:20,201 INFO L272 TraceCheckUtils]: 52: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:20,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:20,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-28 05:30:20,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-28 05:30:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:30:20,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:30:20,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-28 05:30:20,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-28 05:30:20,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:20,465 INFO L272 TraceCheckUtils]: 52: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:20,466 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:20,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:20,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:20,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:20,466 INFO L272 TraceCheckUtils]: 47: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:20,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:30:22,468 WARN L290 TraceCheckUtils]: 45: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is UNKNOWN [2022-04-28 05:30:22,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,470 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #78#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,471 INFO L272 TraceCheckUtils]: 39: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,471 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #76#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L272 TraceCheckUtils]: 34: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #74#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,472 INFO L272 TraceCheckUtils]: 29: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !false; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {3792#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:30:22,473 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3792#true} {3792#true} #72#return; {3792#true} is VALID [2022-04-28 05:30:22,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-28 05:30:22,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-28 05:30:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:30:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:30:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255237328] [2022-04-28 05:30:22,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:30:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936802088] [2022-04-28 05:30:22,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936802088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:30:22,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:30:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-28 05:30:22,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:30:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885223695] [2022-04-28 05:30:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885223695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:30:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303669735] [2022-04-28 05:30:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:30:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-28 05:30:22,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:30:22,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:22,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:22,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:30:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:30:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:30:22,503 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:23,297 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-28 05:30:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:30:23,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-28 05:30:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:30:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-28 05:30:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-28 05:30:23,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-28 05:30:23,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:23,380 INFO L225 Difference]: With dead ends: 118 [2022-04-28 05:30:23,380 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 05:30:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:30:23,381 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:30:23,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:30:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 05:30:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-04-28 05:30:23,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:30:23,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:30:23,450 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:30:23,452 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:30:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:23,458 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-28 05:30:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-28 05:30:23,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:23,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:23,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-28 05:30:23,460 INFO L87 Difference]: Start difference. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-28 05:30:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:23,462 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-28 05:30:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-28 05:30:23,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:23,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:23,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:30:23,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:30:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:30:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-04-28 05:30:23,466 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 56 [2022-04-28 05:30:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:30:23,467 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-04-28 05:30:23,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:30:23,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 138 transitions. [2022-04-28 05:30:23,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:30:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 05:30:23,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:30:23,667 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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, 1] [2022-04-28 05:30:23,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:30:23,873 WARN L477 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-28 05:30:23,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:30:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:30:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times [2022-04-28 05:30:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262453932] [2022-04-28 05:30:23,875 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:30:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 2 times [2022-04-28 05:30:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:30:23,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531425545] [2022-04-28 05:30:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:30:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:30:23,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:30:23,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863388776] [2022-04-28 05:30:23,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:30:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:30:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:30:23,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:30:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:30:23,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:30:23,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:30:23,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:30:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:30:23,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:24,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,257 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-28 05:30:24,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,261 INFO L272 TraceCheckUtils]: 29: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,261 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,262 INFO L272 TraceCheckUtils]: 34: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,262 INFO L272 TraceCheckUtils]: 39: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,263 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:24,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:30:24,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} assume !false; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:30:24,264 INFO L272 TraceCheckUtils]: 47: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #74#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:30:24,265 INFO L272 TraceCheckUtils]: 52: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,266 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #76#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:30:24,267 INFO L272 TraceCheckUtils]: 57: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:24,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:24,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-28 05:30:24,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-28 05:30:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:30:24,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:30:24,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-28 05:30:24,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-28 05:30:24,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:24,454 INFO L272 TraceCheckUtils]: 57: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:24,455 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:30:24,455 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,455 INFO L272 TraceCheckUtils]: 52: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,456 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:30:24,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,456 INFO L272 TraceCheckUtils]: 47: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:30:24,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:30:24,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,624 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #78#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,624 INFO L272 TraceCheckUtils]: 39: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,625 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #76#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,625 INFO L272 TraceCheckUtils]: 34: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,625 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #74#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,626 INFO L272 TraceCheckUtils]: 29: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !false; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:30:24,627 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-28 05:30:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:30:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:30:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531425545] [2022-04-28 05:30:24,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:30:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863388776] [2022-04-28 05:30:24,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863388776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:30:24,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:30:24,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 05:30:24,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:30:24,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262453932] [2022-04-28 05:30:24,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262453932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:24,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:24,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:30:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668429827] [2022-04-28 05:30:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:30:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-28 05:30:24,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:30:24,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 05:30:24,676 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-28 05:30:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:30:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:30:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:30:24,677 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 05:30:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:25,049 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2022-04-28 05:30:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:30:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-28 05:30:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:30:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 05:30:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:30:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 05:30:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:30:25,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 05:30:25,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:25,117 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:30:25,117 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 05:30:25,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:30:25,118 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:30:25,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 160 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:30:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 05:30:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 05:30:25,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:30:25,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 05:30:25,188 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 05:30:25,188 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 05:30:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:25,192 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-28 05:30:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-28 05:30:25,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:25,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:25,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-28 05:30:25,193 INFO L87 Difference]: Start difference. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-28 05:30:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:25,195 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-28 05:30:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-28 05:30:25,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:25,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:25,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:30:25,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:30:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-28 05:30:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2022-04-28 05:30:25,198 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 61 [2022-04-28 05:30:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:30:25,198 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2022-04-28 05:30:25,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 05:30:25,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 167 transitions. [2022-04-28 05:30:25,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-28 05:30:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 05:30:25,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:30:25,378 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 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, 1, 1, 1] [2022-04-28 05:30:25,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:30:25,579 WARN L477 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-28 05:30:25,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:30:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:30:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 1 times [2022-04-28 05:30:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:25,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795720981] [2022-04-28 05:30:25,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:30:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 2 times [2022-04-28 05:30:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:30:25,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598842024] [2022-04-28 05:30:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:30:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:30:25,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:30:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056943853] [2022-04-28 05:30:25,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:30:25,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:30:25,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:30:25,605 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-28 05:30:25,624 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-28 05:30:25,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:30:25,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:30:25,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:30:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:30:25,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:25,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-28 05:30:25,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,949 INFO L272 TraceCheckUtils]: 29: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,959 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,959 INFO L272 TraceCheckUtils]: 34: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,960 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,960 INFO L272 TraceCheckUtils]: 39: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,960 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,962 INFO L272 TraceCheckUtils]: 47: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,962 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #74#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,962 INFO L272 TraceCheckUtils]: 52: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #76#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,963 INFO L272 TraceCheckUtils]: 57: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:25,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:25,964 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #78#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:30:25,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:30:25,966 INFO L272 TraceCheckUtils]: 65: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:25,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:25,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-28 05:30:25,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-28 05:30:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:30:25,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:30:26,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-28 05:30:26,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-28 05:30:26,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:26,173 INFO L272 TraceCheckUtils]: 65: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:26,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,176 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,177 INFO L272 TraceCheckUtils]: 57: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,177 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L272 TraceCheckUtils]: 52: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,178 INFO L272 TraceCheckUtils]: 47: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,182 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,182 INFO L272 TraceCheckUtils]: 39: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,183 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,183 INFO L272 TraceCheckUtils]: 34: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,183 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,184 INFO L272 TraceCheckUtils]: 29: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-28 05:30:26,185 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-28 05:30:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-28 05:30:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:30:26,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598842024] [2022-04-28 05:30:26,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:30:26,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056943853] [2022-04-28 05:30:26,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056943853] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:30:26,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:30:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-28 05:30:26,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:30:26,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795720981] [2022-04-28 05:30:26,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795720981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:30:26,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:30:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:30:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426442832] [2022-04-28 05:30:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:30:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-28 05:30:26,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:30:26,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:26,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:30:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:30:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:30:26,216 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:26,423 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-28 05:30:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:30:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-28 05:30:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:30:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 05:30:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 05:30:26,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 05:30:26,462 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-28 05:30:26,464 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:30:26,464 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 05:30:26,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:30:26,465 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:30:26,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:30:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 05:30:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 05:30:26,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:30:26,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 05:30:26,528 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 05:30:26,528 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 05:30:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:26,531 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:30:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:30:26,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:26,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:26,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-28 05:30:26,532 INFO L87 Difference]: Start difference. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-28 05:30:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:30:26,534 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:30:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:30:26,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:30:26,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:30:26,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:30:26,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:30:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 05:30:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2022-04-28 05:30:26,537 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 69 [2022-04-28 05:30:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:30:26,537 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2022-04-28 05:30:26,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:30:26,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 164 transitions. [2022-04-28 05:30:26,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:30:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:30:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 05:30:26,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:30:26,722 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 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] [2022-04-28 05:30:26,742 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-28 05:30:26,928 WARN L477 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-28 05:30:26,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:30:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:30:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 5 times [2022-04-28 05:30:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:30:26,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586875313] [2022-04-28 05:30:26,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:30:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 6 times [2022-04-28 05:30:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:30:26,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757556279] [2022-04-28 05:30:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:30:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:30:26,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:30:26,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418983782] [2022-04-28 05:30:26,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:30:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:30:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:30:26,944 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-28 05:30:26,945 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-28 05:30:26,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:30:26,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:30:26,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 05:30:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:30:27,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:30:27,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID [2022-04-28 05:30:27,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {7232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {7232#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7232#true} {7232#true} #66#return; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L272 TraceCheckUtils]: 12: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7232#true} #68#return; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L272 TraceCheckUtils]: 17: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7232#true} #70#return; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L272 TraceCheckUtils]: 22: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7232#true} {7232#true} #72#return; {7232#true} is VALID [2022-04-28 05:30:27,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {7232#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,501 INFO L272 TraceCheckUtils]: 29: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,502 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,502 INFO L272 TraceCheckUtils]: 34: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,511 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,512 INFO L272 TraceCheckUtils]: 39: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,512 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {7318#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,514 INFO L272 TraceCheckUtils]: 47: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,515 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #74#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,515 INFO L272 TraceCheckUtils]: 52: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:27,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:27,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:27,516 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #76#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,516 INFO L272 TraceCheckUtils]: 57: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:30:27,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:30:27,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:30:27,517 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #78#return; {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:30:27,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {7373#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-28 05:30:27,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !false; {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-28 05:30:27,519 INFO L272 TraceCheckUtils]: 65: Hoare triple {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:30:27,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:27,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {7398#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:27,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:30:27,521 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7430#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #74#return; {7449#(and (= (- 1) (+ main_~r~0 1)) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:30:27,521 INFO L272 TraceCheckUtils]: 70: Hoare triple {7449#(and (= (- 1) (+ main_~r~0 1)) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:30:27,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:30:27,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {7457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID [2022-04-28 05:30:27,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID [2022-04-28 05:30:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 05:30:27,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:32:27,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID [2022-04-28 05:32:27,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {7457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID [2022-04-28 05:32:27,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:32:27,106 INFO L272 TraceCheckUtils]: 70: Hoare triple {7473#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:32:27,107 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #74#return; {7473#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:32:27,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:27,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:27,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:32:27,108 INFO L272 TraceCheckUtils]: 65: Hoare triple {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:27,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:32:27,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7477#(or (not (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:32:27,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} assume !!(~a~0 != ~b~0); {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID [2022-04-28 05:32:27,486 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #78#return; {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID [2022-04-28 05:32:27,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:27,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:27,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:27,486 INFO L272 TraceCheckUtils]: 57: Hoare triple {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:27,487 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #76#return; {7497#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID [2022-04-28 05:32:27,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:27,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:27,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:32:27,488 INFO L272 TraceCheckUtils]: 52: Hoare triple {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:27,489 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} #74#return; {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID [2022-04-28 05:32:27,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:27,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:27,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:27,489 INFO L272 TraceCheckUtils]: 47: Hoare triple {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:27,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} assume !false; {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is VALID [2022-04-28 05:32:29,491 WARN L290 TraceCheckUtils]: 45: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7519#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (* main_~s~0 (+ main_~p~0 (* (- 1) main_~q~0))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~q~0) 1))))} is UNKNOWN [2022-04-28 05:32:29,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(~a~0 != ~b~0); {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,493 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #78#return; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,493 INFO L272 TraceCheckUtils]: 39: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,494 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #76#return; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,494 INFO L272 TraceCheckUtils]: 34: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,494 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #74#return; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,495 INFO L272 TraceCheckUtils]: 29: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !false; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {7232#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7553#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0)) (not (= (+ (* (+ (* (- 2) main_~s~0) main_~r~0) main_~q~0) 1) (* main_~s~0 (+ main_~p~0 (* (- 2) main_~q~0))))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-28 05:32:29,496 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7232#true} {7232#true} #72#return; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L272 TraceCheckUtils]: 22: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7232#true} #70#return; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L272 TraceCheckUtils]: 17: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7232#true} #68#return; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {7232#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7232#true} {7232#true} #66#return; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {7232#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {7232#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7232#true} is VALID [2022-04-28 05:32:29,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID [2022-04-28 05:32:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 42 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 05:32:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:32:29,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757556279] [2022-04-28 05:32:29,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:32:29,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418983782] [2022-04-28 05:32:29,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418983782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:32:29,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:32:29,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2022-04-28 05:32:29,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:32:29,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586875313] [2022-04-28 05:32:29,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586875313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:32:29,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:32:29,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:32:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544430238] [2022-04-28 05:32:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:32:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74 [2022-04-28 05:32:29,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:32:29,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:32:29,540 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-28 05:32:29,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:32:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:32:29,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:32:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:32:29,540 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:32:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:32:30,618 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions. [2022-04-28 05:32:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:32:30,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74 [2022-04-28 05:32:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:32:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:32:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2022-04-28 05:32:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:32:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2022-04-28 05:32:30,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2022-04-28 05:32:30,710 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-28 05:32:30,713 INFO L225 Difference]: With dead ends: 166 [2022-04-28 05:32:30,713 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 05:32:30,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:32:30,713 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 05:32:30,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 208 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 05:32:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 05:32:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-04-28 05:32:30,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:32:30,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 05:32:30,816 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 05:32:30,817 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 05:32:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:32:30,820 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-04-28 05:32:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-04-28 05:32:30,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:32:30,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:32:30,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 164 states. [2022-04-28 05:32:30,820 INFO L87 Difference]: Start difference. First operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 164 states. [2022-04-28 05:32:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:32:30,823 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-04-28 05:32:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-04-28 05:32:30,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:32:30,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:32:30,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:32:30,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:32:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 05:32:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2022-04-28 05:32:30,826 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 183 transitions. Word has length 74 [2022-04-28 05:32:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:32:30,826 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 183 transitions. [2022-04-28 05:32:30,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:32:30,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 183 transitions. [2022-04-28 05:32:31,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:32:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 183 transitions. [2022-04-28 05:32:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 05:32:31,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:32:31,022 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 3, 3, 3, 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-28 05:32:31,040 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-28 05:32:31,222 WARN L477 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-28 05:32:31,222 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:32:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:32:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 3 times [2022-04-28 05:32:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:32:31,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808301310] [2022-04-28 05:32:31,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:32:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 4 times [2022-04-28 05:32:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:32:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660917156] [2022-04-28 05:32:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:32:31,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:32:31,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:32:31,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983134508] [2022-04-28 05:32:31,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:32:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:32:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:32:31,249 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-28 05:32:31,250 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-28 05:32:31,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:32:31,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:32:31,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 05:32:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:32:31,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:32:32,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {8655#true} call ULTIMATE.init(); {8655#true} is VALID [2022-04-28 05:32:32,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {8655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8655#true} is VALID [2022-04-28 05:32:32,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8655#true} {8655#true} #88#return; {8655#true} is VALID [2022-04-28 05:32:32,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {8655#true} call #t~ret6 := main(); {8655#true} is VALID [2022-04-28 05:32:32,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {8655#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8655#true} {8655#true} #66#return; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {8655#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L272 TraceCheckUtils]: 12: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8655#true} {8655#true} #68#return; {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L272 TraceCheckUtils]: 17: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {8655#true} ~cond := #in~cond; {8714#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:32:32,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {8714#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8718#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:32:32,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {8718#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8718#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:32:32,138 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8718#(not (= |assume_abort_if_not_#in~cond| 0))} {8655#true} #70#return; {8725#(<= 1 main_~x~0)} is VALID [2022-04-28 05:32:32,138 INFO L272 TraceCheckUtils]: 22: Hoare triple {8725#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,139 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8655#true} {8725#(<= 1 main_~x~0)} #72#return; {8725#(<= 1 main_~x~0)} is VALID [2022-04-28 05:32:32,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {8725#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,140 INFO L272 TraceCheckUtils]: 29: Hoare triple {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,140 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8655#true} {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,140 INFO L272 TraceCheckUtils]: 34: Hoare triple {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8655#true} {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,141 INFO L272 TraceCheckUtils]: 39: Hoare triple {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,142 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8655#true} {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {8744#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8796#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {8796#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,143 INFO L272 TraceCheckUtils]: 47: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8655#true} {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #74#return; {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,144 INFO L272 TraceCheckUtils]: 52: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,145 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8655#true} {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #76#return; {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,145 INFO L272 TraceCheckUtils]: 57: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {8655#true} ~cond := #in~cond; {8840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:32:32,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {8840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:32,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:32:32,147 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #78#return; {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:32:32,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {8800#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-28 05:32:32,148 INFO L290 TraceCheckUtils]: 64: Hoare triple {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} assume !false; {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-28 05:32:32,148 INFO L272 TraceCheckUtils]: 65: Hoare triple {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:32:32,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:32:32,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:32:32,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:32:32,149 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8655#true} {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} #74#return; {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-28 05:32:32,149 INFO L272 TraceCheckUtils]: 70: Hoare triple {8857#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:32:32,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:32:32,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {8883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8656#false} is VALID [2022-04-28 05:32:32,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {8656#false} assume !false; {8656#false} is VALID [2022-04-28 05:32:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 05:32:32,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:33:09,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {8656#false} assume !false; {8656#false} is VALID [2022-04-28 05:33:09,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {8883#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8656#false} is VALID [2022-04-28 05:33:09,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8883#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:09,574 INFO L272 TraceCheckUtils]: 70: Hoare triple {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8879#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:33:09,575 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8655#true} {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:33:09,575 INFO L290 TraceCheckUtils]: 68: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:09,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:09,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:09,575 INFO L272 TraceCheckUtils]: 65: Hoare triple {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:09,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:33:09,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {8921#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8899#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:33:09,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {8921#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {8921#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:33:09,685 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {8921#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-28 05:33:09,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:09,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {8938#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:09,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {8655#true} ~cond := #in~cond; {8938#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:33:09,686 INFO L272 TraceCheckUtils]: 57: Hoare triple {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:09,687 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8655#true} {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:33:09,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:09,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:09,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:09,687 INFO L272 TraceCheckUtils]: 52: Hoare triple {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:09,688 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8655#true} {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:33:09,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:09,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:09,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:09,688 INFO L272 TraceCheckUtils]: 47: Hoare triple {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:09,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:33:11,690 WARN L290 TraceCheckUtils]: 45: Hoare triple {8978#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8928#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-28 05:33:11,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !!(~a~0 != ~b~0); {8978#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,691 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8655#true} {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #78#return; {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,692 INFO L272 TraceCheckUtils]: 39: Hoare triple {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,692 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8655#true} {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #76#return; {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,693 INFO L272 TraceCheckUtils]: 34: Hoare triple {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,693 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8655#true} {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #74#return; {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,693 INFO L272 TraceCheckUtils]: 29: Hoare triple {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !false; {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {8655#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8982#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:33:11,695 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8655#true} {8655#true} #72#return; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L272 TraceCheckUtils]: 22: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8655#true} {8655#true} #70#return; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L272 TraceCheckUtils]: 17: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8655#true} {8655#true} #68#return; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L272 TraceCheckUtils]: 12: Hoare triple {8655#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {8655#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8655#true} {8655#true} #66#return; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {8655#true} assume !(0 == ~cond); {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {8655#true} ~cond := #in~cond; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {8655#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {8655#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {8655#true} call #t~ret6 := main(); {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8655#true} {8655#true} #88#return; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {8655#true} assume true; {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {8655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {8655#true} call ULTIMATE.init(); {8655#true} is VALID [2022-04-28 05:33:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-28 05:33:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:33:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660917156] [2022-04-28 05:33:11,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:33:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983134508] [2022-04-28 05:33:11,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983134508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:33:11,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:33:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-28 05:33:11,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:33:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808301310] [2022-04-28 05:33:11,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808301310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:33:11,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:33:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:33:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622630058] [2022-04-28 05:33:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:33:11,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-28 05:33:11,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:33:11,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:33:11,740 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-28 05:33:11,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:33:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:33:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:33:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:33:11,741 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:33:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:13,674 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions. [2022-04-28 05:33:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:33:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-28 05:33:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:33:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:33:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-28 05:33:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:33:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-28 05:33:13,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 85 transitions. [2022-04-28 05:33:13,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:33:13,750 INFO L225 Difference]: With dead ends: 188 [2022-04-28 05:33:13,750 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 05:33:13,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:33:13,751 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:33:13,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 190 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 05:33:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 05:33:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2022-04-28 05:33:13,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:33:13,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 05:33:13,893 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 05:33:13,893 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 05:33:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:13,896 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions. [2022-04-28 05:33:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-04-28 05:33:13,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:33:13,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:33:13,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 186 states. [2022-04-28 05:33:13,897 INFO L87 Difference]: Start difference. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 186 states. [2022-04-28 05:33:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:13,900 INFO L93 Difference]: Finished difference Result 186 states and 226 transitions. [2022-04-28 05:33:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-04-28 05:33:13,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:33:13,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:33:13,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:33:13,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:33:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 106 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 05:33:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2022-04-28 05:33:13,904 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 74 [2022-04-28 05:33:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:33:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2022-04-28 05:33:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:33:13,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 205 transitions. [2022-04-28 05:33:14,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:33:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2022-04-28 05:33:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 05:33:14,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:33:14,143 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:33:14,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 05:33:14,347 WARN L477 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-28 05:33:14,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:33:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:33:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 5 times [2022-04-28 05:33:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:33:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668910049] [2022-04-28 05:33:14,348 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:33:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 6 times [2022-04-28 05:33:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:33:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690005968] [2022-04-28 05:33:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:33:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:33:14,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:33:14,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899347805] [2022-04-28 05:33:14,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:33:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:33:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:33:14,361 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-28 05:33:14,362 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-28 05:33:14,408 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:33:14,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:33:14,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 05:33:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:33:14,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:33:14,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {10215#true} call ULTIMATE.init(); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {10215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10215#true} {10215#true} #88#return; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {10215#true} call #t~ret6 := main(); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {10215#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10215#true} {10215#true} #66#return; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {10215#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L272 TraceCheckUtils]: 12: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10215#true} {10215#true} #68#return; {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10215#true} {10215#true} #70#return; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L272 TraceCheckUtils]: 22: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10215#true} {10215#true} #72#return; {10215#true} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {10215#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,743 INFO L272 TraceCheckUtils]: 29: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,743 INFO L272 TraceCheckUtils]: 34: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,744 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,744 INFO L272 TraceCheckUtils]: 39: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,745 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,746 INFO L272 TraceCheckUtils]: 47: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,746 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10215#true} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,746 INFO L272 TraceCheckUtils]: 52: Hoare triple {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {10215#true} ~cond := #in~cond; {10380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:14,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {10380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:14,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:14,748 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} {10301#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,748 INFO L272 TraceCheckUtils]: 57: Hoare triple {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,749 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10215#true} {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:33:14,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {10391#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:14,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:14,753 INFO L272 TraceCheckUtils]: 65: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,754 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:14,754 INFO L272 TraceCheckUtils]: 70: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:14,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:14,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:14,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:14,755 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:14,755 INFO L272 TraceCheckUtils]: 75: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:33:14,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:14,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {10454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10216#false} is VALID [2022-04-28 05:33:14,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {10216#false} assume !false; {10216#false} is VALID [2022-04-28 05:33:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-28 05:33:14,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:33:23,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {10216#false} assume !false; {10216#false} is VALID [2022-04-28 05:33:23,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {10454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10216#false} is VALID [2022-04-28 05:33:23,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:23,474 INFO L272 TraceCheckUtils]: 75: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:33:23,475 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:23,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:23,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:23,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:23,475 INFO L272 TraceCheckUtils]: 70: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:23,476 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:23,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:23,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:23,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:23,476 INFO L272 TraceCheckUtils]: 65: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:23,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} assume !!(~a~0 != ~b~0); {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:33:24,076 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10215#true} {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} #78#return; {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:33:24,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,076 INFO L272 TraceCheckUtils]: 57: Hoare triple {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,078 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10506#(= (+ (* (- 1) main_~a~0) main_~b~0) (+ main_~y~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:33:24,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:24,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {10537#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:24,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {10215#true} ~cond := #in~cond; {10537#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:33:24,079 INFO L272 TraceCheckUtils]: 52: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,079 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,079 INFO L272 TraceCheckUtils]: 47: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !!(~a~0 != ~b~0); {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,081 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #78#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,081 INFO L272 TraceCheckUtils]: 39: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #76#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L272 TraceCheckUtils]: 34: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10215#true} {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} #74#return; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,083 INFO L272 TraceCheckUtils]: 29: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} assume !false; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {10215#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10413#(= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))) (* (- 1) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:33:24,083 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10215#true} {10215#true} #72#return; {10215#true} is VALID [2022-04-28 05:33:24,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L272 TraceCheckUtils]: 22: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10215#true} {10215#true} #70#return; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L272 TraceCheckUtils]: 17: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10215#true} {10215#true} #68#return; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L272 TraceCheckUtils]: 12: Hoare triple {10215#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {10215#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10215#true} {10215#true} #66#return; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {10215#true} assume !(0 == ~cond); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {10215#true} ~cond := #in~cond; {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {10215#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10215#true} is VALID [2022-04-28 05:33:24,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {10215#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {10215#true} call #t~ret6 := main(); {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10215#true} {10215#true} #88#return; {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {10215#true} assume true; {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {10215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {10215#true} call ULTIMATE.init(); {10215#true} is VALID [2022-04-28 05:33:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-28 05:33:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:33:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690005968] [2022-04-28 05:33:24,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:33:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899347805] [2022-04-28 05:33:24,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899347805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:33:24,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:33:24,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 05:33:24,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:33:24,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668910049] [2022-04-28 05:33:24,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668910049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:33:24,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:33:24,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:33:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613709424] [2022-04-28 05:33:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:33:24,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-28 05:33:24,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:33:24,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:33:24,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:33:24,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:33:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:33:24,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:33:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:33:24,130 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:33:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:24,789 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2022-04-28 05:33:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:33:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-28 05:33:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:33:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:33:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-28 05:33:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:33:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-28 05:33:24,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-28 05:33:24,868 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-28 05:33:24,871 INFO L225 Difference]: With dead ends: 186 [2022-04-28 05:33:24,871 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 05:33:24,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:33:24,871 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:33:24,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 152 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:33:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 05:33:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 153. [2022-04-28 05:33:24,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:33:24,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 05:33:24,990 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 05:33:24,990 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 05:33:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:24,993 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2022-04-28 05:33:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2022-04-28 05:33:24,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:33:24,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:33:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 173 states. [2022-04-28 05:33:24,994 INFO L87 Difference]: Start difference. First operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 173 states. [2022-04-28 05:33:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:33:24,996 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2022-04-28 05:33:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2022-04-28 05:33:24,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:33:24,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:33:24,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:33:24,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:33:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 98 states have internal predecessors, (102), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 05:33:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2022-04-28 05:33:24,999 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 79 [2022-04-28 05:33:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:33:25,000 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2022-04-28 05:33:25,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:33:25,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 173 transitions. [2022-04-28 05:33:25,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:33:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2022-04-28 05:33:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 05:33:25,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:33:25,530 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1] [2022-04-28 05:33:25,546 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-28 05:33:25,731 WARN L477 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-28 05:33:25,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:33:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:33:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 3 times [2022-04-28 05:33:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:33:25,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829093294] [2022-04-28 05:33:25,732 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:33:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 4 times [2022-04-28 05:33:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:33:25,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111953420] [2022-04-28 05:33:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:33:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:33:25,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:33:25,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821083883] [2022-04-28 05:33:25,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:33:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:33:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:33:25,754 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-28 05:33:25,754 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-28 05:33:25,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:33:25,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:33:25,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 05:33:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:33:25,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:33:26,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-28 05:33:26,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11727#true} is VALID [2022-04-28 05:33:26,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11727#true} {11727#true} #88#return; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {11727#true} call #t~ret6 := main(); {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {11727#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {11727#true} #66#return; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {11727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L272 TraceCheckUtils]: 12: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11727#true} {11727#true} #68#return; {11727#true} is VALID [2022-04-28 05:33:26,401 INFO L272 TraceCheckUtils]: 17: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {11727#true} ~cond := #in~cond; {11786#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:33:26,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {11786#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11790#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:33:26,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {11790#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11790#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:33:26,403 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11790#(not (= |assume_abort_if_not_#in~cond| 0))} {11727#true} #70#return; {11797#(<= 1 main_~x~0)} is VALID [2022-04-28 05:33:26,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {11797#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,404 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11727#true} {11797#(<= 1 main_~x~0)} #72#return; {11797#(<= 1 main_~x~0)} is VALID [2022-04-28 05:33:26,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {11797#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,405 INFO L272 TraceCheckUtils]: 29: Hoare triple {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,405 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11727#true} {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,405 INFO L272 TraceCheckUtils]: 34: Hoare triple {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,406 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11727#true} {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,406 INFO L272 TraceCheckUtils]: 39: Hoare triple {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} ~cond := #in~cond; {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:26,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:26,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:26,408 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11816#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {11867#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {11867#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11867#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {11867#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,410 INFO L272 TraceCheckUtils]: 47: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,410 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11727#true} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #74#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,410 INFO L272 TraceCheckUtils]: 52: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,411 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11727#true} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #76#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,411 INFO L272 TraceCheckUtils]: 57: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} ~cond := #in~cond; {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:26,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {11856#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:26,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:33:26,416 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #78#return; {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:33:26,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {11874#(and (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0))) (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID [2022-04-28 05:33:26,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} assume !false; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID [2022-04-28 05:33:26,417 INFO L272 TraceCheckUtils]: 65: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11727#true} {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} #74#return; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID [2022-04-28 05:33:26,418 INFO L272 TraceCheckUtils]: 70: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:33:26,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:33:26,419 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} #76#return; {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} is VALID [2022-04-28 05:33:26,419 INFO L272 TraceCheckUtils]: 75: Hoare triple {11929#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= (- 1) (+ main_~q~0 1)) (= main_~s~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:33:26,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:33:26,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {11970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11728#false} is VALID [2022-04-28 05:33:26,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-28 05:33:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 37 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 05:33:26,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:34:08,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-28 05:34:08,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {11970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11728#false} is VALID [2022-04-28 05:34:08,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:34:08,077 INFO L272 TraceCheckUtils]: 75: Hoare triple {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:34:08,078 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:34:08,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:08,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:08,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:08,078 INFO L272 TraceCheckUtils]: 70: Hoare triple {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:08,078 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11727#true} {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:34:08,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:08,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:08,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:08,079 INFO L272 TraceCheckUtils]: 65: Hoare triple {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:08,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:34:08,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {12023#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11986#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:34:08,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {12023#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {12023#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:34:08,367 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #78#return; {12023#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-28 05:34:08,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:34:08,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:34:08,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} ~cond := #in~cond; {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:34:08,383 INFO L272 TraceCheckUtils]: 57: Hoare triple {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:08,384 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11727#true} {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #76#return; {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:34:08,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:08,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:08,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:08,384 INFO L272 TraceCheckUtils]: 52: Hoare triple {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:08,385 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11727#true} {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #74#return; {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:34:08,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:08,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:08,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:08,385 INFO L272 TraceCheckUtils]: 47: Hoare triple {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:08,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !false; {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:34:10,387 WARN L290 TraceCheckUtils]: 45: Hoare triple {12080#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {12030#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is UNKNOWN [2022-04-28 05:34:10,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {12080#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !!(~a~0 != ~b~0); {12080#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-28 05:34:10,389 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} {11727#true} #78#return; {12080#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-28 05:34:10,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} ~cond := #in~cond; {12040#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:34:10,390 INFO L272 TraceCheckUtils]: 39: Hoare triple {11727#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11727#true} {11727#true} #76#return; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L272 TraceCheckUtils]: 34: Hoare triple {11727#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11727#true} {11727#true} #74#return; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,390 INFO L272 TraceCheckUtils]: 29: Hoare triple {11727#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {11727#true} assume !false; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {11727#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11727#true} {11727#true} #72#return; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L272 TraceCheckUtils]: 22: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11727#true} {11727#true} #70#return; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L272 TraceCheckUtils]: 17: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11727#true} {11727#true} #68#return; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {11727#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {11727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {11727#true} #66#return; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {11727#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {11727#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {11727#true} call #t~ret6 := main(); {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11727#true} {11727#true} #88#return; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-28 05:34:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 05:34:10,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:34:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111953420] [2022-04-28 05:34:10,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:34:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821083883] [2022-04-28 05:34:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821083883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:34:10,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:34:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 05:34:10,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:34:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829093294] [2022-04-28 05:34:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829093294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:34:10,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:34:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:34:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647615844] [2022-04-28 05:34:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:34:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-28 05:34:10,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:34:10,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:34:10,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:34:10,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:34:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:34:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:34:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:34:10,436 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:34:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:34:11,751 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2022-04-28 05:34:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:34:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-28 05:34:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:34:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:34:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 05:34:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:34:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 05:34:11,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 05:34:11,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:34:11,842 INFO L225 Difference]: With dead ends: 175 [2022-04-28 05:34:11,842 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 05:34:11,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:34:11,843 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 05:34:11,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 166 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 05:34:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 05:34:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2022-04-28 05:34:11,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:34:11,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 05:34:11,989 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 05:34:11,989 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 05:34:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:34:11,993 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2022-04-28 05:34:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2022-04-28 05:34:11,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:34:11,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:34:11,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 173 states. [2022-04-28 05:34:11,994 INFO L87 Difference]: Start difference. First operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 173 states. [2022-04-28 05:34:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:34:11,996 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2022-04-28 05:34:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2022-04-28 05:34:11,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:34:11,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:34:11,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:34:11,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:34:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.09) internal successors, (109), 104 states have internal predecessors, (109), 39 states have call successors, (39), 24 states have call predecessors, (39), 23 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-28 05:34:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions. [2022-04-28 05:34:11,999 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 79 [2022-04-28 05:34:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:34:12,000 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions. [2022-04-28 05:34:12,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:34:12,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 186 transitions. [2022-04-28 05:34:13,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:34:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions. [2022-04-28 05:34:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 05:34:13,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:34:13,437 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:34:13,457 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-28 05:34:13,647 WARN L477 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-28 05:34:13,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:34:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:34:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 7 times [2022-04-28 05:34:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:34:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506446812] [2022-04-28 05:34:13,648 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:34:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 8 times [2022-04-28 05:34:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:34:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884633808] [2022-04-28 05:34:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:34:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:34:13,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:34:13,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70137240] [2022-04-28 05:34:13,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:34:13,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:34:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:34:13,659 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-28 05:34:13,661 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-28 05:34:13,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:34:13,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:34:13,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 05:34:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:34:13,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:05,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {13246#true} call ULTIMATE.init(); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {13246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13246#true} {13246#true} #88#return; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {13246#true} call #t~ret6 := main(); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {13246#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13246#true} {13246#true} #66#return; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {13246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L272 TraceCheckUtils]: 12: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,117 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13246#true} {13246#true} #68#return; {13246#true} is VALID [2022-04-28 05:38:05,117 INFO L272 TraceCheckUtils]: 17: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {13246#true} ~cond := #in~cond; {13305#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:38:05,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {13305#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13309#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:05,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {13309#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13309#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:05,118 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13309#(not (= |assume_abort_if_not_#in~cond| 0))} {13246#true} #70#return; {13316#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:05,118 INFO L272 TraceCheckUtils]: 22: Hoare triple {13316#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,118 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13246#true} {13316#(<= 1 main_~x~0)} #72#return; {13316#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:05,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {13316#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,119 INFO L272 TraceCheckUtils]: 29: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,120 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #74#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,120 INFO L272 TraceCheckUtils]: 34: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,121 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #76#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,121 INFO L272 TraceCheckUtils]: 39: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,121 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13246#true} {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #78#return; {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:05,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {13335#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 1 main_~p~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !false; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,123 INFO L272 TraceCheckUtils]: 47: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,124 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #74#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,124 INFO L272 TraceCheckUtils]: 52: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,124 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #76#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,124 INFO L272 TraceCheckUtils]: 57: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,125 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13246#true} {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #78#return; {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !!(~a~0 != ~b~0); {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-28 05:38:05,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {13390#(and (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (< main_~b~0 main_~x~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,127 INFO L272 TraceCheckUtils]: 65: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,128 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13246#true} {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #74#return; {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,128 INFO L272 TraceCheckUtils]: 70: Hoare triple {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {13246#true} ~cond := #in~cond; {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:05,129 INFO L290 TraceCheckUtils]: 72: Hoare triple {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:05,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:05,130 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13445#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #76#return; {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,130 INFO L272 TraceCheckUtils]: 75: Hoare triple {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {13246#true} ~cond := #in~cond; {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:05,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {13470#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:05,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:05,132 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13481#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (<= 1 main_~p~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #78#return; {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(~a~0 != ~b~0); {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:38:05,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {13497#(and (= (+ (* main_~a~0 2) main_~b~0) main_~x~0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< 0 main_~a~0) (<= (* main_~a~0 2) main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID [2022-04-28 05:38:05,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} assume !false; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID [2022-04-28 05:38:05,140 INFO L272 TraceCheckUtils]: 83: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:05,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:05,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:05,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:05,141 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13246#true} {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} #74#return; {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} is VALID [2022-04-28 05:38:05,142 INFO L272 TraceCheckUtils]: 88: Hoare triple {13504#(and (<= (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* 2 (* main_~p~0 main_~x~0))) main_~x~0) (= (mod main_~r~0 3) 0) (= (+ main_~y~0 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)) main_~x~0) (< 0 (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* main_~p~0 main_~x~0) (* main_~x~0 (div (* (- 1) main_~p~0) 2)))) (= main_~x~0 (+ (* 2 (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2)))) (* main_~x~0 (div (- main_~p~0) 2)) (* main_~y~0 (div (* (- 2) main_~r~0) 3)) (* 2 (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0)))) (= (mod main_~p~0 2) 0) (= main_~a~0 (+ (* (- 1) (* main_~y~0 (div (* (- 2) main_~r~0) 3))) (* main_~x~0 (+ main_~p~0 (div (- main_~p~0) 2))) (* (+ main_~r~0 (div (* (- 2) main_~r~0) 3)) main_~y~0) (* (- 1) (* main_~x~0 (div (- main_~p~0) 2))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:05,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:05,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13247#false} is VALID [2022-04-28 05:38:05,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {13247#false} assume !false; {13247#false} is VALID [2022-04-28 05:38:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 66 proven. 38 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-04-28 05:38:05,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:33,787 INFO L290 TraceCheckUtils]: 91: Hoare triple {13247#false} assume !false; {13247#false} is VALID [2022-04-28 05:38:33,787 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13247#false} is VALID [2022-04-28 05:38:33,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13530#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:33,788 INFO L272 TraceCheckUtils]: 88: Hoare triple {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13526#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:33,789 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13246#true} {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:38:33,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:33,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:33,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:33,789 INFO L272 TraceCheckUtils]: 83: Hoare triple {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:33,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:38:34,036 INFO L290 TraceCheckUtils]: 81: Hoare triple {13568#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13546#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:38:34,036 INFO L290 TraceCheckUtils]: 80: Hoare triple {13568#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {13568#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:38:34,037 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13575#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {13568#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:38:34,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:34,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:34,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {13246#true} ~cond := #in~cond; {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:38:34,038 INFO L272 TraceCheckUtils]: 75: Hoare triple {13575#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,039 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} {13246#true} #76#return; {13575#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:38:34,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13474#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {13246#true} ~cond := #in~cond; {13585#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:38:34,040 INFO L272 TraceCheckUtils]: 70: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L272 TraceCheckUtils]: 65: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {13246#true} assume !false; {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {13246#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {13246#true} assume !!(~a~0 != ~b~0); {13246#true} is VALID [2022-04-28 05:38:34,040 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13246#true} {13246#true} #78#return; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L272 TraceCheckUtils]: 57: Hoare triple {13246#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13246#true} {13246#true} #76#return; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L272 TraceCheckUtils]: 52: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L272 TraceCheckUtils]: 47: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {13246#true} assume !false; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {13246#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {13246#true} assume !!(~a~0 != ~b~0); {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13246#true} {13246#true} #78#return; {13246#true} is VALID [2022-04-28 05:38:34,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L272 TraceCheckUtils]: 39: Hoare triple {13246#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13246#true} {13246#true} #76#return; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L272 TraceCheckUtils]: 34: Hoare triple {13246#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13246#true} {13246#true} #74#return; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L272 TraceCheckUtils]: 29: Hoare triple {13246#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {13246#true} assume !false; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {13246#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13246#true} {13246#true} #72#return; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13246#true} {13246#true} #70#return; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L272 TraceCheckUtils]: 17: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13246#true} {13246#true} #68#return; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {13246#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {13246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13246#true} {13246#true} #66#return; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {13246#true} assume !(0 == ~cond); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {13246#true} ~cond := #in~cond; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {13246#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {13246#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13246#true} is VALID [2022-04-28 05:38:34,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {13246#true} call #t~ret6 := main(); {13246#true} is VALID [2022-04-28 05:38:34,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13246#true} {13246#true} #88#return; {13246#true} is VALID [2022-04-28 05:38:34,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {13246#true} assume true; {13246#true} is VALID [2022-04-28 05:38:34,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {13246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13246#true} is VALID [2022-04-28 05:38:34,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {13246#true} call ULTIMATE.init(); {13246#true} is VALID [2022-04-28 05:38:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-28 05:38:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884633808] [2022-04-28 05:38:34,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70137240] [2022-04-28 05:38:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70137240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:34,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 19 [2022-04-28 05:38:34,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506446812] [2022-04-28 05:38:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506446812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:38:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013266319] [2022-04-28 05:38:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 92 [2022-04-28 05:38:34,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:34,045 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), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 05:38:34,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:34,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:38:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:38:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:38:34,118 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 05:38:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,065 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-28 05:38:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:38:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 92 [2022-04-28 05:38:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 05:38:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 05:38:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 05:38:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 05:38:48,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 05:38:48,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:48,191 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:38:48,191 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 05:38:48,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:38:48,192 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:48,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 189 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 05:38:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 05:38:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-28 05:38:48,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:48,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 05:38:48,445 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 05:38:48,445 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 05:38:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,449 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2022-04-28 05:38:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2022-04-28 05:38:48,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 191 states. [2022-04-28 05:38:48,450 INFO L87 Difference]: Start difference. First operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 191 states. [2022-04-28 05:38:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,453 INFO L93 Difference]: Finished difference Result 191 states and 222 transitions. [2022-04-28 05:38:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2022-04-28 05:38:48,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:48,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 121 states have internal predecessors, (127), 48 states have call successors, (48), 27 states have call predecessors, (48), 26 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 05:38:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 222 transitions. [2022-04-28 05:38:48,456 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 222 transitions. Word has length 92 [2022-04-28 05:38:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:48,457 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 222 transitions. [2022-04-28 05:38:48,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 05:38:48,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 222 transitions. [2022-04-28 05:38:49,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2022-04-28 05:38:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 05:38:49,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:49,799 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:49,817 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-28 05:38:49,999 WARN L477 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-28 05:38:49,999 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 9 times [2022-04-28 05:38:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:50,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634362010] [2022-04-28 05:38:50,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 10 times [2022-04-28 05:38:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:50,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934964644] [2022-04-28 05:38:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:50,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:50,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957033252] [2022-04-28 05:38:50,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:38:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:50,012 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-28 05:38:50,013 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-28 05:38:50,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:38:50,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:50,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 05:38:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:50,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:32,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {14972#true} call ULTIMATE.init(); {14972#true} is VALID [2022-04-28 05:43:32,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {14972#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#true} {14972#true} #88#return; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#true} call #t~ret6 := main(); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#true} {14972#true} #66#return; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {14972#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L272 TraceCheckUtils]: 12: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14972#true} {14972#true} #68#return; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14972#true} {14972#true} #70#return; {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14972#true} {14972#true} #72#return; {14972#true} is VALID [2022-04-28 05:43:32,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {14972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,018 INFO L272 TraceCheckUtils]: 29: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,019 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14972#true} {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,019 INFO L272 TraceCheckUtils]: 34: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:32,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,020 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,020 INFO L272 TraceCheckUtils]: 39: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,021 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14972#true} {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {15058#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,022 INFO L272 TraceCheckUtils]: 47: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,023 INFO L272 TraceCheckUtils]: 52: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,023 INFO L272 TraceCheckUtils]: 57: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,024 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14972#true} {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:32,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#(and (= main_~r~0 0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} assume !false; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,025 INFO L272 TraceCheckUtils]: 65: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,026 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14972#true} {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #74#return; {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,026 INFO L272 TraceCheckUtils]: 70: Hoare triple {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:32,027 INFO L290 TraceCheckUtils]: 72: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,028 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15170#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #76#return; {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,028 INFO L272 TraceCheckUtils]: 75: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {14972#true} ~cond := #in~cond; {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:32,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {15083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:32,029 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} #78#return; {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,030 INFO L290 TraceCheckUtils]: 80: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} assume !!(~a~0 != ~b~0); {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} is VALID [2022-04-28 05:43:32,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {15204#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~r~0 (* (- 1) main_~s~0)) (= (+ main_~p~0 (* main_~q~0 2)) 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID [2022-04-28 05:43:32,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} assume !false; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID [2022-04-28 05:43:32,039 INFO L272 TraceCheckUtils]: 83: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:43:32,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:43:32,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:43:32,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:43:32,040 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14972#true} {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} #74#return; {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} is VALID [2022-04-28 05:43:32,060 INFO L272 TraceCheckUtils]: 88: Hoare triple {15226#(and (= (mod (* main_~p~0 2) 3) 0) (= main_~a~0 (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) main_~x~0 (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0) (* (- 1) main_~y~0))) (= (mod main_~r~0 2) 0) (= (+ (* (div (- main_~p~0) 3) 2) main_~p~0) 1) (= (+ (* main_~x~0 (+ (div (- main_~p~0) 3) main_~p~0)) (* (+ (div (- main_~r~0) 2) main_~r~0) main_~y~0)) (+ (* main_~x~0 2) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:32,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {15248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:32,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {15252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14973#false} is VALID [2022-04-28 05:43:32,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {14973#false} assume !false; {14973#false} is VALID [2022-04-28 05:43:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-28 05:43:32,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:08,419 INFO L290 TraceCheckUtils]: 91: Hoare triple {14973#false} assume !false; {14973#false} is VALID [2022-04-28 05:44:08,419 INFO L290 TraceCheckUtils]: 90: Hoare triple {15252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14973#false} is VALID [2022-04-28 05:44:08,420 INFO L290 TraceCheckUtils]: 89: Hoare triple {15248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:08,420 INFO L272 TraceCheckUtils]: 88: Hoare triple {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:08,421 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14972#true} {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:08,421 INFO L290 TraceCheckUtils]: 86: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,421 INFO L290 TraceCheckUtils]: 85: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,421 INFO L290 TraceCheckUtils]: 84: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,421 INFO L272 TraceCheckUtils]: 83: Hoare triple {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:08,579 INFO L290 TraceCheckUtils]: 81: Hoare triple {15290#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {15268#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:08,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {15290#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {15290#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:44:08,581 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {15297#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {15290#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 05:44:08,581 INFO L290 TraceCheckUtils]: 78: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:08,581 INFO L290 TraceCheckUtils]: 77: Hoare triple {15307#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:08,581 INFO L290 TraceCheckUtils]: 76: Hoare triple {14972#true} ~cond := #in~cond; {15307#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:44:08,581 INFO L272 TraceCheckUtils]: 75: Hoare triple {15297#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,583 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} {14972#true} #76#return; {15297#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:44:08,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:08,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {15307#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:08,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {14972#true} ~cond := #in~cond; {15307#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:44:08,583 INFO L272 TraceCheckUtils]: 70: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L272 TraceCheckUtils]: 65: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {14972#true} assume !false; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {14972#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {14972#true} assume !!(~a~0 != ~b~0); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14972#true} {14972#true} #78#return; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L272 TraceCheckUtils]: 57: Hoare triple {14972#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14972#true} {14972#true} #76#return; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L272 TraceCheckUtils]: 52: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,584 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L272 TraceCheckUtils]: 47: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {14972#true} assume !false; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {14972#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {14972#true} assume !!(~a~0 != ~b~0); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14972#true} {14972#true} #78#return; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L272 TraceCheckUtils]: 39: Hoare triple {14972#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14972#true} {14972#true} #76#return; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L272 TraceCheckUtils]: 34: Hoare triple {14972#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14972#true} {14972#true} #74#return; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L272 TraceCheckUtils]: 29: Hoare triple {14972#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {14972#true} assume !false; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {14972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14972#true} {14972#true} #72#return; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L272 TraceCheckUtils]: 22: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14972#true} {14972#true} #70#return; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L272 TraceCheckUtils]: 17: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14972#true} {14972#true} #68#return; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L272 TraceCheckUtils]: 12: Hoare triple {14972#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {14972#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#true} {14972#true} #66#return; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#true} assume !(0 == ~cond); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#true} ~cond := #in~cond; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#true} call #t~ret6 := main(); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#true} {14972#true} #88#return; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#true} assume true; {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {14972#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {14972#true} call ULTIMATE.init(); {14972#true} is VALID [2022-04-28 05:44:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-28 05:44:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934964644] [2022-04-28 05:44:08,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957033252] [2022-04-28 05:44:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957033252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:44:08,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:44:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-28 05:44:08,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634362010] [2022-04-28 05:44:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634362010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:08,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:44:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931753012] [2022-04-28 05:44:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:08,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-28 05:44:08,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:08,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 05:44:08,675 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-28 05:44:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:44:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:44:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:44:08,676 INFO L87 Difference]: Start difference. First operand 191 states and 222 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 05:44:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:12,051 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2022-04-28 05:44:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:44:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-28 05:44:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 05:44:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2022-04-28 05:44:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 05:44:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2022-04-28 05:44:12,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 79 transitions. [2022-04-28 05:44:12,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:12,228 INFO L225 Difference]: With dead ends: 220 [2022-04-28 05:44:12,228 INFO L226 Difference]: Without dead ends: 218 [2022-04-28 05:44:12,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:44:12,229 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:12,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 214 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 05:44:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-28 05:44:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-28 05:44:12,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:12,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:44:12,464 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:44:12,464 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:44:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:12,468 INFO L93 Difference]: Finished difference Result 218 states and 256 transitions. [2022-04-28 05:44:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 256 transitions. [2022-04-28 05:44:12,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:12,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:12,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 218 states. [2022-04-28 05:44:12,469 INFO L87 Difference]: Start difference. First operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 218 states. [2022-04-28 05:44:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:12,473 INFO L93 Difference]: Finished difference Result 218 states and 256 transitions. [2022-04-28 05:44:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 256 transitions. [2022-04-28 05:44:12,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:12,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:12,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:12,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.105263157894737) internal successors, (147), 137 states have internal predecessors, (147), 55 states have call successors, (55), 30 states have call predecessors, (55), 29 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:44:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 256 transitions. [2022-04-28 05:44:12,478 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 256 transitions. Word has length 92 [2022-04-28 05:44:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:12,479 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 256 transitions. [2022-04-28 05:44:12,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 05:44:12,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 256 transitions. [2022-04-28 05:44:13,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 256 transitions. [2022-04-28 05:44:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 05:44:13,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:13,300 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:13,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 05:44:13,500 WARN L477 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-28 05:44:13,500 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 11 times [2022-04-28 05:44:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685292795] [2022-04-28 05:44:13,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 12 times [2022-04-28 05:44:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942306890] [2022-04-28 05:44:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:13,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384679603] [2022-04-28 05:44:13,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:44:13,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:13,512 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-28 05:44:13,526 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-28 05:44:13,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:44:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:13,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 05:44:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:13,609 INFO L286 TraceCheckSpWp]: Computing forward predicates...