/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:43:42,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:43:42,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:43:42,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:43:42,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:43:42,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:43:42,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:43:42,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:43:42,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:43:42,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:43:42,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:43:42,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:43:42,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:43:42,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:43:42,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:43:42,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:43:42,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:43:42,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:43:42,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:43:42,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:43:42,413 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:43:42,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:43:42,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:43:42,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:43:42,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:43:42,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:43:42,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:43:42,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:43:42,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:43:42,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:43:42,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:43:42,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:43:42,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:43:42,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:43:42,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:43:42,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:43:42,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:43:42,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:43:42,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:43:42,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:43:42,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:43:42,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:43:42,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:43:42,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:43:42,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:43:42,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:43:42,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:43:42,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:43:42,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:43:42,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:43:42,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:43:42,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:43:42,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:43:42,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:43:42,453 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:43:42,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:43:42,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:43:42,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:43:42,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:43:42,640 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:43:42,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-08 10:43:42,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89e306df/98a9f419e1f8462c93fa95f7723389d7/FLAG53517e26d [2022-04-08 10:43:43,051 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:43:43,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-08 10:43:43,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89e306df/98a9f419e1f8462c93fa95f7723389d7/FLAG53517e26d [2022-04-08 10:43:43,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89e306df/98a9f419e1f8462c93fa95f7723389d7 [2022-04-08 10:43:43,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:43:43,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:43:43,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:43:43,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:43:43,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:43:43,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2214ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43, skipping insertion in model container [2022-04-08 10:43:43,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:43:43,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:43:43,221 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/egcd-ll.c[489,502] [2022-04-08 10:43:43,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:43:43,249 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:43:43,257 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/egcd-ll.c[489,502] [2022-04-08 10:43:43,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:43:43,271 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:43:43,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43 WrapperNode [2022-04-08 10:43:43,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:43:43,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:43:43,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:43:43,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:43:43,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:43:43,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:43:43,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:43:43,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:43:43,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (1/1) ... [2022-04-08 10:43:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:43:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:43,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:43:43,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:43:43,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:43:43,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:43:43,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:43:43,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:43:43,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:43:43,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:43:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:43:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:43:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:43:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:43:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:43:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:43:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:43:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:43:43,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:43:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:43:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:43:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:43:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:43:43,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:43:43,466 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:43:43,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:43:43,629 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:43:43,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:43:43,634 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:43:43,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:43:43 BoogieIcfgContainer [2022-04-08 10:43:43,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:43:43,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:43:43,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:43:43,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:43:43,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:43:43" (1/3) ... [2022-04-08 10:43:43,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410b4b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:43:43, skipping insertion in model container [2022-04-08 10:43:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:43:43" (2/3) ... [2022-04-08 10:43:43,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410b4b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:43:43, skipping insertion in model container [2022-04-08 10:43:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:43:43" (3/3) ... [2022-04-08 10:43:43,659 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll.c [2022-04-08 10:43:43,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:43:43,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:43:43,726 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:43:43,737 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:43:43,737 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:43:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 10:43:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:43:43,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:43,771 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:43,771 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2012836591, now seen corresponding path program 1 times [2022-04-08 10:43:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:43,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244085497] [2022-04-08 10:43:43,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2012836591, now seen corresponding path program 2 times [2022-04-08 10:43:43,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:43,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696923209] [2022-04-08 10:43:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:43:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:43,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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); {37#true} is VALID [2022-04-08 10:43:43,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 10:43:43,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-08 10:43:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:43:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:43,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 10:43:43,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 10:43:43,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 10:43:43,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-08 10:43:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 10:43:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:43,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 10:43:43,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 10:43:43,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 10:43:43,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-08 10:43:43,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:43:43,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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); {37#true} is VALID [2022-04-08 10:43:43,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 10:43:43,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-08 10:43:43,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-08 10:43:43,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37#true} is VALID [2022-04-08 10:43:43,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-08 10:43:43,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 10:43:43,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 10:43:43,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 10:43:43,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-08 10:43:43,967 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-08 10:43:43,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 10:43:43,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 10:43:43,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 10:43:43,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-08 10:43:43,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {38#false} is VALID [2022-04-08 10:43:43,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} assume false; {38#false} is VALID [2022-04-08 10:43:43,968 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {38#false} is VALID [2022-04-08 10:43:43,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-08 10:43:43,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-08 10:43:43,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-08 10:43:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:43:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696923209] [2022-04-08 10:43:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696923209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:43,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:43,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:43:43,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:43,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244085497] [2022-04-08 10:43:43,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244085497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:43,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:43,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:43:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217598854] [2022-04-08 10:43:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:43:43,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:43,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:43:43,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:43,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:43:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:43:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:43:44,015 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:43:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,153 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-04-08 10:43:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:43:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:43:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:43:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-08 10:43:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:43:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-08 10:43:44,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-08 10:43:44,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:44,282 INFO L225 Difference]: With dead ends: 61 [2022-04-08 10:43:44,282 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:43:44,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:43:44,289 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:43:44,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:43:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:43:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 10:43:44,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:44,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:43:44,320 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:43:44,320 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:43:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,324 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-08 10:43:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-08 10:43:44,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:44,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:44,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-08 10:43:44,326 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-08 10:43:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,329 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-08 10:43:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-08 10:43:44,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:44,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:44,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:44,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 10:43:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-08 10:43:44,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2022-04-08 10:43:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:44,333 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-08 10:43:44,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:43:44,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 37 transitions. [2022-04-08 10:43:44,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-08 10:43:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:43:44,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:44,373 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:44,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:43:44,374 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1952740121, now seen corresponding path program 1 times [2022-04-08 10:43:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:44,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641106525] [2022-04-08 10:43:44,375 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1952740121, now seen corresponding path program 2 times [2022-04-08 10:43:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:44,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091447486] [2022-04-08 10:43:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:44,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:44,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165268261] [2022-04-08 10:43:44,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:44,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:44,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:44,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:43:44,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:43:44,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:44,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:43:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:44,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:44,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2022-04-08 10:43:44,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {291#true} is VALID [2022-04-08 10:43:44,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-08 10:43:44,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #81#return; {291#true} is VALID [2022-04-08 10:43:44,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret6 := main(); {291#true} is VALID [2022-04-08 10:43:44,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {291#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {291#true} is VALID [2022-04-08 10:43:44,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {291#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {291#true} is VALID [2022-04-08 10:43:44,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#true} ~cond := #in~cond; {291#true} is VALID [2022-04-08 10:43:44,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#true} assume !(0 == ~cond); {291#true} is VALID [2022-04-08 10:43:44,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-08 10:43:44,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {291#true} {291#true} #63#return; {291#true} is VALID [2022-04-08 10:43:44,601 INFO L272 TraceCheckUtils]: 11: Hoare triple {291#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {291#true} is VALID [2022-04-08 10:43:44,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#true} ~cond := #in~cond; {291#true} is VALID [2022-04-08 10:43:44,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {291#true} assume !(0 == ~cond); {291#true} is VALID [2022-04-08 10:43:44,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-08 10:43:44,602 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {291#true} {291#true} #65#return; {291#true} is VALID [2022-04-08 10:43:44,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {291#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {344#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 10:43:44,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {344#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {344#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 10:43:44,604 INFO L272 TraceCheckUtils]: 18: Hoare triple {344#(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)); {351#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:44,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {351#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {355#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:44,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {355#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {292#false} is VALID [2022-04-08 10:43:44,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-08 10:43:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:43:44,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:43:44,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:44,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091447486] [2022-04-08 10:43:44,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:43:44,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165268261] [2022-04-08 10:43:44,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165268261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:44,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:44,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:44,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:44,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641106525] [2022-04-08 10:43:44,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641106525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:44,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:44,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020602979] [2022-04-08 10:43:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 10:43:44,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:44,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:43:44,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:44,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:43:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:43:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:43:44,624 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:43:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,818 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-08 10:43:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:43:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 10:43:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:43:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 10:43:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:43:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 10:43:44,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-08 10:43:44,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:44,888 INFO L225 Difference]: With dead ends: 45 [2022-04-08 10:43:44,888 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 10:43:44,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-08 10:43:44,891 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 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-08 10:43:44,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:43:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 10:43:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-08 10:43:44,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:44,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:44,910 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:44,911 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,917 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-08 10:43:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-08 10:43:44,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:44,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:44,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-08 10:43:44,922 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-08 10:43:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:44,927 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-08 10:43:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-08 10:43:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:44,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:44,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-04-08 10:43:44,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 22 [2022-04-08 10:43:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:44,936 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-04-08 10:43:44,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:43:44,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 57 transitions. [2022-04-08 10:43:44,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-08 10:43:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:43:44,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:44,993 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:45,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:43:45,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:45,208 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 652987931, now seen corresponding path program 1 times [2022-04-08 10:43:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289815993] [2022-04-08 10:43:45,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash 652987931, now seen corresponding path program 2 times [2022-04-08 10:43:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952056706] [2022-04-08 10:43:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:45,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:45,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047585880] [2022-04-08 10:43:45,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:45,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:45,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:43:45,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:43:45,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:45,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:43:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:45,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:45,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-08 10:43:45,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {623#true} is VALID [2022-04-08 10:43:45,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 10:43:45,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #81#return; {623#true} is VALID [2022-04-08 10:43:45,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-08 10:43:45,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-08 10:43:45,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-08 10:43:45,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 10:43:45,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 10:43:45,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 10:43:45,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #63#return; {623#true} is VALID [2022-04-08 10:43:45,484 INFO L272 TraceCheckUtils]: 11: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-08 10:43:45,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#true} ~cond := #in~cond; {664#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:43:45,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {668#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:43:45,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {668#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:43:45,485 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {668#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #65#return; {675#(<= 1 main_~y~0)} is VALID [2022-04-08 10:43:45,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {679#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:45,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {679#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {679#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:45,487 INFO L272 TraceCheckUtils]: 18: Hoare triple {679#(and (= main_~r~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)); {623#true} is VALID [2022-04-08 10:43:45,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 10:43:45,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 10:43:45,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 10:43:45,488 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {623#true} {679#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {679#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:45,489 INFO L272 TraceCheckUtils]: 23: Hoare triple {679#(and (= main_~r~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)); {701#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:45,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {701#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {705#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:45,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {705#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-08 10:43:45,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-08 10:43:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:43:45,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:43:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952056706] [2022-04-08 10:43:45,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:43:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047585880] [2022-04-08 10:43:45,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047585880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:45,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:45,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:43:45,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:45,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289815993] [2022-04-08 10:43:45,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289815993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:45,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:45,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:43:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061002627] [2022-04-08 10:43:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 10:43:45,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:45,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:43:45,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:45,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:43:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:43:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:43:45,514 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:43:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:45,878 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-08 10:43:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:43:45,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-08 10:43:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:43:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 10:43:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:43:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 10:43:45,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-08 10:43:45,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:45,937 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:43:45,937 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:43:45,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:43:45,938 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:43:45,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 161 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:43:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:43:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-08 10:43:45,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:45,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:45,959 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:45,959 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:45,962 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 10:43:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-08 10:43:45,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:45,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:45,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-08 10:43:45,963 INFO L87 Difference]: Start difference. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-08 10:43:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:45,964 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 10:43:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-08 10:43:45,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:45,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:45,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:45,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 10:43:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-08 10:43:45,967 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 27 [2022-04-08 10:43:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:45,967 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-08 10:43:45,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:43:45,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-08 10:43:46,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-08 10:43:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:43:46,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:46,026 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:46,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:43:46,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:43:46,231 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1028398105, now seen corresponding path program 1 times [2022-04-08 10:43:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111275677] [2022-04-08 10:43:46,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1028398105, now seen corresponding path program 2 times [2022-04-08 10:43:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:46,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025722092] [2022-04-08 10:43:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:46,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:46,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912928458] [2022-04-08 10:43:46,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:46,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:46,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:43:46,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:43:46,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:46,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:43:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:46,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:46,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {999#true} is VALID [2022-04-08 10:43:46,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {999#true} is VALID [2022-04-08 10:43:46,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #81#return; {999#true} is VALID [2022-04-08 10:43:46,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret6 := main(); {999#true} is VALID [2022-04-08 10:43:46,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {999#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {999#true} is VALID [2022-04-08 10:43:46,461 INFO L272 TraceCheckUtils]: 6: Hoare triple {999#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {999#true} is VALID [2022-04-08 10:43:46,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#true} ~cond := #in~cond; {1025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:43:46,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:43:46,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:43:46,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} {999#true} #63#return; {1036#(<= 1 main_~x~0)} is VALID [2022-04-08 10:43:46,462 INFO L272 TraceCheckUtils]: 11: Hoare triple {1036#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {999#true} is VALID [2022-04-08 10:43:46,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {999#true} {1036#(<= 1 main_~x~0)} #65#return; {1036#(<= 1 main_~x~0)} is VALID [2022-04-08 10:43:46,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {1036#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:43:46,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:43:46,464 INFO L272 TraceCheckUtils]: 18: Hoare triple {1055#(and (<= 1 main_~x~0) (= 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)); {999#true} is VALID [2022-04-08 10:43:46,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,465 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {999#true} {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #67#return; {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:43:46,465 INFO L272 TraceCheckUtils]: 23: Hoare triple {1055#(and (<= 1 main_~x~0) (= 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)); {999#true} is VALID [2022-04-08 10:43:46,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,466 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {999#true} {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #69#return; {1055#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:43:46,467 INFO L272 TraceCheckUtils]: 28: Hoare triple {1055#(and (<= 1 main_~x~0) (= 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)); {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:46,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:46,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1000#false} is VALID [2022-04-08 10:43:46,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-04-08 10:43:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:43:46,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:43:46,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-04-08 10:43:46,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1000#false} is VALID [2022-04-08 10:43:46,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:46,638 INFO L272 TraceCheckUtils]: 28: Hoare triple {1112#(= 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)); {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:46,639 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {999#true} {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:43:46,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,650 INFO L272 TraceCheckUtils]: 23: Hoare triple {1112#(= 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)); {999#true} is VALID [2022-04-08 10:43:46,652 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {999#true} {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:43:46,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,652 INFO L272 TraceCheckUtils]: 18: Hoare triple {1112#(= 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)); {999#true} is VALID [2022-04-08 10:43:46,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:43:46,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1112#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:43:46,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {999#true} {999#true} #65#return; {999#true} is VALID [2022-04-08 10:43:46,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L272 TraceCheckUtils]: 11: Hoare triple {999#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {999#true} is VALID [2022-04-08 10:43:46,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {999#true} {999#true} #63#return; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {999#true} assume !(0 == ~cond); {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#true} ~cond := #in~cond; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {999#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {999#true} is VALID [2022-04-08 10:43:46,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {999#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {999#true} is VALID [2022-04-08 10:43:46,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {999#true} call #t~ret6 := main(); {999#true} is VALID [2022-04-08 10:43:46,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {999#true} {999#true} #81#return; {999#true} is VALID [2022-04-08 10:43:46,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {999#true} assume true; {999#true} is VALID [2022-04-08 10:43:46,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {999#true} is VALID [2022-04-08 10:43:46,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {999#true} call ULTIMATE.init(); {999#true} is VALID [2022-04-08 10:43:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 10:43:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025722092] [2022-04-08 10:43:46,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:43:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912928458] [2022-04-08 10:43:46,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912928458] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:43:46,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:43:46,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 10:43:46,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:46,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111275677] [2022-04-08 10:43:46,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111275677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:46,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:46,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946583053] [2022-04-08 10:43:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-08 10:43:46,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:46,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 10:43:46,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:46,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:43:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:43:46,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:43:46,674 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 10:43:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:46,881 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-08 10:43:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:43:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-08 10:43:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 10:43:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 10:43:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 10:43:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 10:43:46,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-08 10:43:46,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:46,934 INFO L225 Difference]: With dead ends: 71 [2022-04-08 10:43:46,934 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:43:46,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:43:46,935 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:43:46,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:43:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:43:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 10:43:46,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:46,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:46,969 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:46,969 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:46,972 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-08 10:43:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-08 10:43:46,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:46,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:46,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-08 10:43:46,973 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-08 10:43:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:46,975 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-08 10:43:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-08 10:43:46,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:46,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:46,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:46,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-04-08 10:43:46,978 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 32 [2022-04-08 10:43:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:46,979 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-04-08 10:43:46,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 10:43:46,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 93 transitions. [2022-04-08 10:43:47,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-08 10:43:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:43:47,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:47,093 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-08 10:43:47,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:43:47,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:47,311 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -134474469, now seen corresponding path program 1 times [2022-04-08 10:43:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296269675] [2022-04-08 10:43:47,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -134474469, now seen corresponding path program 2 times [2022-04-08 10:43:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472889751] [2022-04-08 10:43:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:47,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235929513] [2022-04-08 10:43:47,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:47,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:47,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:47,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:43:47,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:43:47,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:47,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 10:43:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:47,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:47,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1611#true} call ULTIMATE.init(); {1611#true} is VALID [2022-04-08 10:43:47,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {1611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1611#true} is VALID [2022-04-08 10:43:47,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1611#true} {1611#true} #81#return; {1611#true} is VALID [2022-04-08 10:43:47,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {1611#true} call #t~ret6 := main(); {1611#true} is VALID [2022-04-08 10:43:47,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {1611#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {1611#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1611#true} ~cond := #in~cond; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1611#true} assume !(0 == ~cond); {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1611#true} {1611#true} #63#return; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {1611#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1611#true} ~cond := #in~cond; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#true} assume !(0 == ~cond); {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1611#true} {1611#true} #65#return; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1611#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1611#true} is VALID [2022-04-08 10:43:47,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {1611#true} assume !false; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L272 TraceCheckUtils]: 18: Hoare triple {1611#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#true} ~cond := #in~cond; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {1611#true} assume !(0 == ~cond); {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1611#true} {1611#true} #67#return; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L272 TraceCheckUtils]: 23: Hoare triple {1611#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#true} ~cond := #in~cond; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {1611#true} assume !(0 == ~cond); {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1611#true} {1611#true} #69#return; {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L272 TraceCheckUtils]: 28: Hoare triple {1611#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1611#true} is VALID [2022-04-08 10:43:47,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {1611#true} ~cond := #in~cond; {1611#true} is VALID [2022-04-08 10:43:47,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {1611#true} assume !(0 == ~cond); {1611#true} is VALID [2022-04-08 10:43:47,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {1611#true} assume true; {1611#true} is VALID [2022-04-08 10:43:47,446 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1611#true} {1611#true} #71#return; {1611#true} is VALID [2022-04-08 10:43:47,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {1611#true} assume !(~a~0 != ~b~0); {1715#(= main_~b~0 main_~a~0)} is VALID [2022-04-08 10:43:47,447 INFO L272 TraceCheckUtils]: 34: Hoare triple {1715#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:47,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {1719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:47,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {1723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1612#false} is VALID [2022-04-08 10:43:47,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {1612#false} assume !false; {1612#false} is VALID [2022-04-08 10:43:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:43:47,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:43:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472889751] [2022-04-08 10:43:47,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:43:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235929513] [2022-04-08 10:43:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235929513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:47,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:47,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:47,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296269675] [2022-04-08 10:43:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296269675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:47,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:47,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885095029] [2022-04-08 10:43:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-08 10:43:47,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:47,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 10:43:47,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:47,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:43:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:43:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:43:47,468 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 10:43:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:47,637 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-04-08 10:43:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:43:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-08 10:43:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 10:43:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 10:43:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 10:43:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 10:43:47,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-08 10:43:47,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:47,675 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:43:47,675 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 10:43:47,675 INFO L912 BasicCegarLoop]: 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-08 10:43:47,678 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 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-08 10:43:47,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:43:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 10:43:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 10:43:47,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:47,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:47,724 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:47,725 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:47,730 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-08 10:43:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-08 10:43:47,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:47,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:47,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-08 10:43:47,731 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-08 10:43:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:47,735 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-08 10:43:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-08 10:43:47,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:47,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:47,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:47,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 10:43:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-08 10:43:47,741 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 38 [2022-04-08 10:43:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:47,743 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-08 10:43:47,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 10:43:47,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 96 transitions. [2022-04-08 10:43:47,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-08 10:43:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:43:47,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:47,833 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:43:47,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 10:43:48,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:48,048 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 251096952, now seen corresponding path program 1 times [2022-04-08 10:43:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:48,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059287055] [2022-04-08 10:43:48,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash 251096952, now seen corresponding path program 2 times [2022-04-08 10:43:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310643998] [2022-04-08 10:43:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:48,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:48,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556323547] [2022-04-08 10:43:48,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:48,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:43:48,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:43:48,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:48,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:43:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:48,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:48,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2022-04-08 10:43:48,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2161#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2161#true} is VALID [2022-04-08 10:43:48,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2161#true} #81#return; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2161#true} call #t~ret6 := main(); {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2161#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {2161#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2161#true} {2161#true} #63#return; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L272 TraceCheckUtils]: 11: Hoare triple {2161#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2161#true} {2161#true} #65#return; {2161#true} is VALID [2022-04-08 10:43:48,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {2161#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,286 INFO L272 TraceCheckUtils]: 18: Hoare triple {2214#(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)); {2161#true} is VALID [2022-04-08 10:43:48,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2022-04-08 10:43:48,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2022-04-08 10:43:48,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,287 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2161#true} {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,287 INFO L272 TraceCheckUtils]: 23: Hoare triple {2214#(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)); {2161#true} is VALID [2022-04-08 10:43:48,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2022-04-08 10:43:48,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2022-04-08 10:43:48,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,288 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2161#true} {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,288 INFO L272 TraceCheckUtils]: 28: Hoare triple {2214#(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)); {2161#true} is VALID [2022-04-08 10:43:48,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2022-04-08 10:43:48,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2022-04-08 10:43:48,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {2161#true} assume true; {2161#true} is VALID [2022-04-08 10:43:48,289 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2161#true} {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {2214#(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; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2214#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:43:48,290 INFO L272 TraceCheckUtils]: 36: Hoare triple {2214#(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)); {2275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:48,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {2275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:48,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {2279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2162#false} is VALID [2022-04-08 10:43:48,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2022-04-08 10:43:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:43:48,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:43:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:43:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310643998] [2022-04-08 10:43:48,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:43:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556323547] [2022-04-08 10:43:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556323547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:48,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:48,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:48,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:43:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059287055] [2022-04-08 10:43:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059287055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:43:48,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:43:48,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:43:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030672550] [2022-04-08 10:43:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:43:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 40 [2022-04-08 10:43:48,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:43:48,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:43:48,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:48,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:43:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:43:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:43:48,311 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:43:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:48,488 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-04-08 10:43:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:43:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 40 [2022-04-08 10:43:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:43:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:43:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 10:43:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:43:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 10:43:48,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-08 10:43:48,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:48,530 INFO L225 Difference]: With dead ends: 81 [2022-04-08 10:43:48,530 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 10:43:48,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-08 10:43:48,531 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 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-08 10:43:48,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:43:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 10:43:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-08 10:43:48,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:43:48,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:43:48,572 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:43:48,572 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:43:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:48,575 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-08 10:43:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-08 10:43:48,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:48,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:48,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-08 10:43:48,576 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-08 10:43:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:43:48,578 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-08 10:43:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-08 10:43:48,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:43:48,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:43:48,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:43:48,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:43:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 10:43:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-08 10:43:48,581 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2022-04-08 10:43:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:43:48,581 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-08 10:43:48,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:43:48,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-08 10:43:48,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:43:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 10:43:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:43:48,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:43:48,669 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2022-04-08 10:43:48,698 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-08 10:43:48,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:48,888 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:43:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:43:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1098226535, now seen corresponding path program 1 times [2022-04-08 10:43:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:43:48,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2130450770] [2022-04-08 10:43:48,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:43:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1098226535, now seen corresponding path program 2 times [2022-04-08 10:43:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:43:48,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865430311] [2022-04-08 10:43:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:43:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:43:48,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:43:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282861775] [2022-04-08 10:43:48,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:43:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:43:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:43:48,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:43:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 10:43:48,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:43:48,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:43:48,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:43:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:43:48,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:43:49,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {2757#true} call ULTIMATE.init(); {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2757#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2757#true} {2757#true} #81#return; {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {2757#true} call #t~ret6 := main(); {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {2757#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {2757#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2757#true} {2757#true} #63#return; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L272 TraceCheckUtils]: 11: Hoare triple {2757#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2757#true} {2757#true} #65#return; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {2757#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#true} assume !false; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L272 TraceCheckUtils]: 18: Hoare triple {2757#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2757#true} {2757#true} #67#return; {2757#true} is VALID [2022-04-08 10:43:49,090 INFO L272 TraceCheckUtils]: 23: Hoare triple {2757#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:43:49,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {2757#true} ~cond := #in~cond; {2834#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:49,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {2834#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:43:49,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:43:49,095 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} {2757#true} #69#return; {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:43:49,095 INFO L272 TraceCheckUtils]: 28: Hoare triple {2845#(= 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)); {2757#true} is VALID [2022-04-08 10:43:49,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:43:49,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:43:49,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,097 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2757#true} {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:43:49,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:43:49,097 INFO L272 TraceCheckUtils]: 34: Hoare triple {2864#(= 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)); {2757#true} is VALID [2022-04-08 10:43:49,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:43:49,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:43:49,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:43:49,098 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2757#true} {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:43:49,098 INFO L272 TraceCheckUtils]: 39: Hoare triple {2864#(= 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)); {2883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:43:49,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {2883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:43:49,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {2887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2758#false} is VALID [2022-04-08 10:43:49,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {2758#false} assume !false; {2758#false} is VALID [2022-04-08 10:43:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 10:43:49,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:05,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {2758#false} assume !false; {2758#false} is VALID [2022-04-08 10:44:05,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {2887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2758#false} is VALID [2022-04-08 10:44:05,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {2883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:05,726 INFO L272 TraceCheckUtils]: 39: Hoare triple {2864#(= 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)); {2883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:05,726 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2757#true} {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:05,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:44:05,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:44:05,727 INFO L272 TraceCheckUtils]: 34: Hoare triple {2864#(= 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)); {2757#true} is VALID [2022-04-08 10:44:05,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2864#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:05,728 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2757#true} {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:05,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:44:05,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:44:05,728 INFO L272 TraceCheckUtils]: 28: Hoare triple {2845#(= 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)); {2757#true} is VALID [2022-04-08 10:44:05,729 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} {2757#true} #69#return; {2845#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:05,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:05,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {2948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {2757#true} ~cond := #in~cond; {2948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:44:05,730 INFO L272 TraceCheckUtils]: 23: Hoare triple {2757#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2757#true} {2757#true} #67#return; {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {2757#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#true} assume !false; {2757#true} is VALID [2022-04-08 10:44:05,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {2757#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2757#true} {2757#true} #65#return; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L272 TraceCheckUtils]: 11: Hoare triple {2757#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2757#true} {2757#true} #63#return; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {2757#true} assume !(0 == ~cond); {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {2757#true} ~cond := #in~cond; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {2757#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {2757#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2757#true} call #t~ret6 := main(); {2757#true} is VALID [2022-04-08 10:44:05,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2757#true} {2757#true} #81#return; {2757#true} is VALID [2022-04-08 10:44:05,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {2757#true} assume true; {2757#true} is VALID [2022-04-08 10:44:05,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {2757#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2757#true} is VALID [2022-04-08 10:44:05,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {2757#true} call ULTIMATE.init(); {2757#true} is VALID [2022-04-08 10:44:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 10:44:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:05,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865430311] [2022-04-08 10:44:05,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:05,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282861775] [2022-04-08 10:44:05,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282861775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:44:05,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:44:05,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 10:44:05,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:05,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2130450770] [2022-04-08 10:44:05,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2130450770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:05,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:05,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:44:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975488326] [2022-04-08 10:44:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-08 10:44:05,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:05,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:44:05,759 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-08 10:44:05,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:44:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:44:05,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:44:05,760 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:44:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:06,190 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-08 10:44:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:44:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-08 10:44:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:44:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 10:44:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:44:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 10:44:06,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 10:44:06,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:06,234 INFO L225 Difference]: With dead ends: 85 [2022-04-08 10:44:06,234 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 10:44:06,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 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-08 10:44:06,235 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:44:06,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:44:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 10:44:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-08 10:44:06,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:06,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:44:06,284 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:44:06,286 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:44:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:06,288 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 10:44:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 10:44:06,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:06,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:06,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-08 10:44:06,289 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-08 10:44:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:06,292 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 10:44:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 10:44:06,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:06,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:06,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:06,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 10:44:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-08 10:44:06,295 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 43 [2022-04-08 10:44:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:06,296 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-08 10:44:06,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 10:44:06,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 100 transitions. [2022-04-08 10:44:06,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 10:44:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:44:06,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:06,537 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:06,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-08 10:44:06,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:06,738 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -17648356, now seen corresponding path program 3 times [2022-04-08 10:44:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:06,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400145873] [2022-04-08 10:44:06,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -17648356, now seen corresponding path program 4 times [2022-04-08 10:44:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:06,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804144407] [2022-04-08 10:44:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:06,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:06,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614678731] [2022-04-08 10:44:06,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:44:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:06,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:06,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:06,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 10:44:06,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:44:06,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:06,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:44:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:06,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:07,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {3523#true} call ULTIMATE.init(); {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {3523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3523#true} {3523#true} #81#return; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {3523#true} call #t~ret6 := main(); {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {3523#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {3523#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3523#true} {3523#true} #63#return; {3523#true} is VALID [2022-04-08 10:44:07,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {3523#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {3523#true} ~cond := #in~cond; {3564#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:44:07,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {3564#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3568#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:07,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3568#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:07,475 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#(not (= |assume_abort_if_not_#in~cond| 0))} {3523#true} #65#return; {3575#(<= 1 main_~y~0)} is VALID [2022-04-08 10:44:07,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {3575#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,476 INFO L272 TraceCheckUtils]: 18: Hoare triple {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:07,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:07,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:07,476 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3523#true} {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #67#return; {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,481 INFO L272 TraceCheckUtils]: 23: Hoare triple {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {3523#true} ~cond := #in~cond; {3604#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:07,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {3604#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:07,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:07,483 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} {3579#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #69#return; {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,483 INFO L272 TraceCheckUtils]: 28: Hoare triple {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:07,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:07,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:07,484 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3523#true} {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} #71#return; {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:07,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {3615#(and (= main_~r~0 0) (= 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) (<= 1 main_~y~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; {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} is VALID [2022-04-08 10:44:07,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} assume !false; {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} is VALID [2022-04-08 10:44:07,485 INFO L272 TraceCheckUtils]: 36: Hoare triple {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:07,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:07,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:07,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:07,486 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3523#true} {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} #67#return; {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} is VALID [2022-04-08 10:44:07,487 INFO L272 TraceCheckUtils]: 41: Hoare triple {3637#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (* (- 1) main_~r~0) 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:07,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {3659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:07,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3524#false} is VALID [2022-04-08 10:44:07,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {3524#false} assume !false; {3524#false} is VALID [2022-04-08 10:44:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:44:07,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:39,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {3524#false} assume !false; {3524#false} is VALID [2022-04-08 10:44:39,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {3663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3524#false} is VALID [2022-04-08 10:44:39,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {3659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:39,880 INFO L272 TraceCheckUtils]: 41: Hoare triple {3679#(= 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)); {3659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:39,881 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3523#true} {3679#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {3679#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:39,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:39,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:39,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:39,881 INFO L272 TraceCheckUtils]: 36: Hoare triple {3679#(= 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)); {3523#true} is VALID [2022-04-08 10:44:39,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {3679#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3679#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:41,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {3701#(= (+ 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; {3679#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:41,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {3701#(= (+ 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); {3701#(= (+ 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-08 10:44:41,763 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3523#true} {3701#(= (+ 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)))))} #71#return; {3701#(= (+ 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-08 10:44:41,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:41,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:41,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:41,763 INFO L272 TraceCheckUtils]: 28: Hoare triple {3701#(= (+ 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)); {3523#true} is VALID [2022-04-08 10:44:41,764 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} {3723#(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)))))} #69#return; {3701#(= (+ 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-08 10:44:41,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:41,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3608#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:41,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {3523#true} ~cond := #in~cond; {3733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:44:41,771 INFO L272 TraceCheckUtils]: 23: Hoare triple {3723#(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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:41,773 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3523#true} {3723#(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)))))} #67#return; {3723#(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)))))} is VALID [2022-04-08 10:44:41,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:41,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:41,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:41,773 INFO L272 TraceCheckUtils]: 18: Hoare triple {3723#(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)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:41,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {3723#(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)))))} assume !false; {3723#(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)))))} is VALID [2022-04-08 10:44:41,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {3523#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3723#(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)))))} is VALID [2022-04-08 10:44:41,781 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3523#true} {3523#true} #65#return; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L272 TraceCheckUtils]: 11: Hoare triple {3523#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3523#true} {3523#true} #63#return; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {3523#true} assume !(0 == ~cond); {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {3523#true} ~cond := #in~cond; {3523#true} is VALID [2022-04-08 10:44:41,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {3523#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {3523#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {3523#true} call #t~ret6 := main(); {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3523#true} {3523#true} #81#return; {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {3523#true} assume true; {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {3523#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {3523#true} call ULTIMATE.init(); {3523#true} is VALID [2022-04-08 10:44:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 10:44:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804144407] [2022-04-08 10:44:41,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:41,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614678731] [2022-04-08 10:44:41,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614678731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:44:41,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:44:41,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 10:44:41,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:41,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400145873] [2022-04-08 10:44:41,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400145873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:41,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:41,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:44:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167058778] [2022-04-08 10:44:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-04-08 10:44:41,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:41,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-08 10:44:41,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:41,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:44:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:44:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:44:41,832 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-08 10:44:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:43,215 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-04-08 10:44:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:44:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-04-08 10:44:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-08 10:44:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-08 10:44:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-08 10:44:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2022-04-08 10:44:43,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2022-04-08 10:44:43,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:43,348 INFO L225 Difference]: With dead ends: 115 [2022-04-08 10:44:43,348 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 10:44:43,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:44:43,349 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:44:43,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 132 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:44:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 10:44:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2022-04-08 10:44:43,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:43,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:44:43,418 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:44:43,421 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:44:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:43,425 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2022-04-08 10:44:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2022-04-08 10:44:43,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:43,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:43,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand 113 states. [2022-04-08 10:44:43,426 INFO L87 Difference]: Start difference. First operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand 113 states. [2022-04-08 10:44:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:43,429 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2022-04-08 10:44:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2022-04-08 10:44:43,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:43,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:43,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:43,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 10:44:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2022-04-08 10:44:43,435 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 45 [2022-04-08 10:44:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:43,435 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2022-04-08 10:44:43,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-08 10:44:43,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 133 transitions. [2022-04-08 10:44:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2022-04-08 10:44:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 10:44:43,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:43,568 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:43,587 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-08 10:44:43,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:43,777 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:43,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1834363254, now seen corresponding path program 1 times [2022-04-08 10:44:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598500178] [2022-04-08 10:44:43,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1834363254, now seen corresponding path program 2 times [2022-04-08 10:44:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086708084] [2022-04-08 10:44:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:43,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:43,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957609809] [2022-04-08 10:44:43,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:44:43,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:43,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:43,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 10:44:43,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:44:43,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:43,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:44:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:43,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:44,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {4488#true} call ULTIMATE.init(); {4488#true} is VALID [2022-04-08 10:44:44,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {4488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4488#true} is VALID [2022-04-08 10:44:44,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4488#true} {4488#true} #81#return; {4488#true} is VALID [2022-04-08 10:44:44,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {4488#true} call #t~ret6 := main(); {4488#true} is VALID [2022-04-08 10:44:44,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {4488#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4488#true} is VALID [2022-04-08 10:44:44,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {4488#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4488#true} is VALID [2022-04-08 10:44:44,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {4488#true} ~cond := #in~cond; {4514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:44:44,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {4514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4518#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:44,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {4518#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4518#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:44,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4518#(not (= |assume_abort_if_not_#in~cond| 0))} {4488#true} #63#return; {4525#(<= 1 main_~x~0)} is VALID [2022-04-08 10:44:44,339 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4488#true} is VALID [2022-04-08 10:44:44,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,351 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4488#true} {4525#(<= 1 main_~x~0)} #65#return; {4525#(<= 1 main_~x~0)} is VALID [2022-04-08 10:44:44,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {4525#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4544#(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-08 10:44:44,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(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; {4544#(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-08 10:44:44,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {4544#(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)); {4488#true} is VALID [2022-04-08 10:44:44,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,353 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4488#true} {4544#(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))} #67#return; {4544#(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-08 10:44:44,353 INFO L272 TraceCheckUtils]: 23: Hoare triple {4544#(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)); {4488#true} is VALID [2022-04-08 10:44:44,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,354 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4488#true} {4544#(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))} #69#return; {4544#(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-08 10:44:44,354 INFO L272 TraceCheckUtils]: 28: Hoare triple {4544#(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)); {4488#true} is VALID [2022-04-08 10:44:44,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,355 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4488#true} {4544#(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))} #71#return; {4544#(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-08 10:44:44,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {4544#(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); {4544#(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-08 10:44:44,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {4544#(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);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 10:44:44,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} assume !false; {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 10:44:44,356 INFO L272 TraceCheckUtils]: 36: Hoare triple {4599#(and (<= 1 main_~x~0) (= 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)); {4488#true} is VALID [2022-04-08 10:44:44,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,357 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4488#true} {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #67#return; {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 10:44:44,357 INFO L272 TraceCheckUtils]: 41: Hoare triple {4599#(and (<= 1 main_~x~0) (= 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)); {4488#true} is VALID [2022-04-08 10:44:44,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,358 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4488#true} {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #69#return; {4599#(and (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 10:44:44,358 INFO L272 TraceCheckUtils]: 46: Hoare triple {4599#(and (<= 1 main_~x~0) (= 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)); {4636#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:44,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {4636#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4640#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:44,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {4640#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4489#false} is VALID [2022-04-08 10:44:44,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {4489#false} assume !false; {4489#false} is VALID [2022-04-08 10:44:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-08 10:44:44,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:44,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {4489#false} assume !false; {4489#false} is VALID [2022-04-08 10:44:44,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {4640#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4489#false} is VALID [2022-04-08 10:44:44,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {4636#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4640#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:44,669 INFO L272 TraceCheckUtils]: 46: Hoare triple {4656#(= 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)); {4636#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:44,669 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4488#true} {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:44:44,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,670 INFO L272 TraceCheckUtils]: 41: Hoare triple {4656#(= 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)); {4488#true} is VALID [2022-04-08 10:44:44,670 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4488#true} {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:44:44,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,675 INFO L272 TraceCheckUtils]: 36: Hoare triple {4656#(= 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)); {4488#true} is VALID [2022-04-08 10:44:44,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:44:44,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {4693#(= (+ (* (+ 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; {4656#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:44:44,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {4693#(= (+ (* (+ 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); {4693#(= (+ (* (+ 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-08 10:44:44,842 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4488#true} {4693#(= (+ (* (+ 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))} #71#return; {4693#(= (+ (* (+ 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-08 10:44:44,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,842 INFO L272 TraceCheckUtils]: 28: Hoare triple {4693#(= (+ (* (+ 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)); {4488#true} is VALID [2022-04-08 10:44:44,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4488#true} {4693#(= (+ (* (+ 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))} #69#return; {4693#(= (+ (* (+ 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-08 10:44:44,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,844 INFO L272 TraceCheckUtils]: 23: Hoare triple {4693#(= (+ (* (+ 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)); {4488#true} is VALID [2022-04-08 10:44:44,851 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4488#true} {4693#(= (+ (* (+ 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))} #67#return; {4693#(= (+ (* (+ 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-08 10:44:44,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,851 INFO L272 TraceCheckUtils]: 18: Hoare triple {4693#(= (+ (* (+ 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)); {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {4693#(= (+ (* (+ 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; {4693#(= (+ (* (+ 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-08 10:44:44,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {4488#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4693#(= (+ (* (+ 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-08 10:44:44,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4488#true} {4488#true} #65#return; {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {4488#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4488#true} is VALID [2022-04-08 10:44:44,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4488#true} {4488#true} #63#return; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {4488#true} assume !(0 == ~cond); {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {4488#true} ~cond := #in~cond; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {4488#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {4488#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {4488#true} call #t~ret6 := main(); {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4488#true} {4488#true} #81#return; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {4488#true} assume true; {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {4488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {4488#true} call ULTIMATE.init(); {4488#true} is VALID [2022-04-08 10:44:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 10:44:44,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:44,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086708084] [2022-04-08 10:44:44,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:44,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957609809] [2022-04-08 10:44:44,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957609809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:44:44,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:44:44,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-08 10:44:44,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:44,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598500178] [2022-04-08 10:44:44,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598500178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:44,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:44,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:44:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235076637] [2022-04-08 10:44:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 10:44:44,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:44,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 10:44:44,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:44,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:44:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:44:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:44:44,887 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 10:44:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:45,947 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2022-04-08 10:44:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:44:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 50 [2022-04-08 10:44:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 10:44:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 10:44:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 10:44:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-08 10:44:45,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-08 10:44:46,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:46,013 INFO L225 Difference]: With dead ends: 134 [2022-04-08 10:44:46,013 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 10:44:46,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 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-08 10:44:46,013 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:44:46,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 166 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:44:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 10:44:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-08 10:44:46,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:46,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 10:44:46,111 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 10:44:46,112 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 10:44:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:46,120 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2022-04-08 10:44:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-08 10:44:46,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:46,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:46,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-08 10:44:46,121 INFO L87 Difference]: Start difference. First operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-08 10:44:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:46,127 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2022-04-08 10:44:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-08 10:44:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:46,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:46,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:46,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 10:44:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2022-04-08 10:44:46,130 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 50 [2022-04-08 10:44:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:46,130 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2022-04-08 10:44:46,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 10:44:46,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 162 transitions. [2022-04-08 10:44:46,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-08 10:44:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 10:44:46,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:46,340 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:46,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 10:44:46,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 10:44:46,540 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -152607915, now seen corresponding path program 1 times [2022-04-08 10:44:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:46,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362962247] [2022-04-08 10:44:46,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -152607915, now seen corresponding path program 2 times [2022-04-08 10:44:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:46,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068459039] [2022-04-08 10:44:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:46,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132686923] [2022-04-08 10:44:46,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:44:46,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:46,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 10:44:46,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:44:46,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:46,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:44:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:46,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:47,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 10:44:47,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5582#true} is VALID [2022-04-08 10:44:47,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #81#return; {5582#true} is VALID [2022-04-08 10:44:47,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret6 := main(); {5582#true} is VALID [2022-04-08 10:44:47,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5582#true} is VALID [2022-04-08 10:44:47,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5582#true} #63#return; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5582#true} #65#return; {5582#true} is VALID [2022-04-08 10:44:47,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,082 INFO L272 TraceCheckUtils]: 18: Hoare triple {5635#(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)); {5582#true} is VALID [2022-04-08 10:44:47,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,083 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5582#true} {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,083 INFO L272 TraceCheckUtils]: 23: Hoare triple {5635#(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)); {5582#true} is VALID [2022-04-08 10:44:47,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,083 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5582#true} {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {5635#(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)); {5582#true} is VALID [2022-04-08 10:44:47,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,084 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5582#true} {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {5635#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:47,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {5635#(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; {5690#(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-08 10:44:47,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {5690#(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; {5690#(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-08 10:44:47,086 INFO L272 TraceCheckUtils]: 36: Hoare triple {5690#(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)); {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5582#true} {5690#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #67#return; {5690#(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-08 10:44:47,086 INFO L272 TraceCheckUtils]: 41: Hoare triple {5690#(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)); {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,087 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5582#true} {5690#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #69#return; {5690#(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-08 10:44:47,087 INFO L272 TraceCheckUtils]: 46: Hoare triple {5690#(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)); {5582#true} is VALID [2022-04-08 10:44:47,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,088 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5582#true} {5690#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #71#return; {5690#(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-08 10:44:47,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {5690#(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); {5690#(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-08 10:44:47,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {5690#(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; {5745#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (- 1) main_~r~0))} is VALID [2022-04-08 10:44:47,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {5745#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (- 1) main_~r~0))} assume !false; {5745#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (- 1) main_~r~0))} is VALID [2022-04-08 10:44:47,090 INFO L272 TraceCheckUtils]: 54: Hoare triple {5745#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (- 1) main_~r~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:47,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {5752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:47,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {5756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 10:44:47,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 10:44:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 10:44:47,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:47,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 10:44:47,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {5756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 10:44:47,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {5752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:47,306 INFO L272 TraceCheckUtils]: 54: Hoare triple {5772#(= (* 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)); {5752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:47,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {5772#(= (* 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; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,309 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,309 INFO L272 TraceCheckUtils]: 46: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L272 TraceCheckUtils]: 41: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,310 INFO L272 TraceCheckUtils]: 36: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {5772#(= (* 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; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,313 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,313 INFO L272 TraceCheckUtils]: 28: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,314 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,314 INFO L272 TraceCheckUtils]: 23: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5582#true} {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L272 TraceCheckUtils]: 18: Hoare triple {5772#(= (* 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)); {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5772#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 10:44:47,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5582#true} #65#return; {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5582#true} #63#return; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret6 := main(); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #81#return; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 10:44:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-08 10:44:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:47,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068459039] [2022-04-08 10:44:47,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:47,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132686923] [2022-04-08 10:44:47,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132686923] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:44:47,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:44:47,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-08 10:44:47,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362962247] [2022-04-08 10:44:47,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362962247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:47,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:44:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847262278] [2022-04-08 10:44:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:47,320 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, (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 58 [2022-04-08 10:44:47,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:47,320 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, (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-08 10:44:47,339 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-08 10:44:47,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:44:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:44:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:44:47,340 INFO L87 Difference]: Start difference. First operand 128 states and 162 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, (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-08 10:44:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:47,572 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-04-08 10:44:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:44:47,572 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, (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 58 [2022-04-08 10:44:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:47,574 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, (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-08 10:44:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 10:44:47,575 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, (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-08 10:44:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 10:44:47,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-08 10:44:47,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:47,612 INFO L225 Difference]: With dead ends: 134 [2022-04-08 10:44:47,612 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 10:44:47,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 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-08 10:44:47,613 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 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-08 10:44:47,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:44:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 10:44:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-08 10:44:47,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:47,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 10:44:47,711 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 10:44:47,711 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 10:44:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:47,737 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2022-04-08 10:44:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2022-04-08 10:44:47,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:47,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:47,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 129 states. [2022-04-08 10:44:47,738 INFO L87 Difference]: Start difference. First operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 129 states. [2022-04-08 10:44:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:47,743 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2022-04-08 10:44:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2022-04-08 10:44:47,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:47,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:47,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:47,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.16) internal successors, (87), 78 states have internal predecessors, (87), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 10:44:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2022-04-08 10:44:47,748 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 58 [2022-04-08 10:44:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:47,749 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2022-04-08 10:44:47,749 INFO L479 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, (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-08 10:44:47,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 159 transitions. [2022-04-08 10:44:47,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2022-04-08 10:44:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 10:44:47,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:47,971 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 10:44:48,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 10:44:48,171 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1386725923, now seen corresponding path program 5 times [2022-04-08 10:44:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:48,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201286869] [2022-04-08 10:44:48,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1386725923, now seen corresponding path program 6 times [2022-04-08 10:44:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:48,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378937233] [2022-04-08 10:44:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:48,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391925629] [2022-04-08 10:44:48,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:44:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:48,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:48,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 10:44:48,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:44:48,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:48,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 10:44:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:48,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:48,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {6723#true} call ULTIMATE.init(); {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {6723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6723#true} {6723#true} #81#return; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {6723#true} call #t~ret6 := main(); {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {6723#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {6723#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6723#true} {6723#true} #63#return; {6723#true} is VALID [2022-04-08 10:44:48,789 INFO L272 TraceCheckUtils]: 11: Hoare triple {6723#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:48,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {6723#true} ~cond := #in~cond; {6764#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:44:48,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {6764#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6768#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:48,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {6768#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6768#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:44:48,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6768#(not (= |assume_abort_if_not_#in~cond| 0))} {6723#true} #65#return; {6775#(<= 1 main_~y~0)} is VALID [2022-04-08 10:44:48,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {6775#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6779#(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-08 10:44:48,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {6779#(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; {6779#(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-08 10:44:48,792 INFO L272 TraceCheckUtils]: 18: Hoare triple {6779#(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)); {6723#true} is VALID [2022-04-08 10:44:48,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6723#true} {6779#(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))} #67#return; {6779#(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-08 10:44:48,793 INFO L272 TraceCheckUtils]: 23: Hoare triple {6779#(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)); {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6723#true} {6779#(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))} #69#return; {6779#(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-08 10:44:48,793 INFO L272 TraceCheckUtils]: 28: Hoare triple {6779#(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)); {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,794 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6723#true} {6779#(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))} #71#return; {6779#(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-08 10:44:48,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {6779#(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); {6779#(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-08 10:44:48,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {6779#(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; {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,806 INFO L272 TraceCheckUtils]: 36: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~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)); {6723#true} is VALID [2022-04-08 10:44:48,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,807 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6723#true} {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #67#return; {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,807 INFO L272 TraceCheckUtils]: 41: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~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)); {6723#true} is VALID [2022-04-08 10:44:48,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,808 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6723#true} {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #69#return; {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,808 INFO L272 TraceCheckUtils]: 46: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~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)); {6723#true} is VALID [2022-04-08 10:44:48,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,809 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6723#true} {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #71#return; {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:44:48,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {6834#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 main_~y~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; {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:48,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:48,810 INFO L272 TraceCheckUtils]: 54: Hoare triple {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:48,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:48,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:48,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:48,811 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6723#true} {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} #67#return; {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 10:44:48,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {6889#(and (= (- 2) main_~r~0) (= (+ main_~a~0 (* main_~y~0 2)) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:48,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {6911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:48,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {6915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6724#false} is VALID [2022-04-08 10:44:48,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {6724#false} assume !false; {6724#false} is VALID [2022-04-08 10:44:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-08 10:44:48,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:49,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {6724#false} assume !false; {6724#false} is VALID [2022-04-08 10:44:49,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {6915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6724#false} is VALID [2022-04-08 10:44:49,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {6911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:49,361 INFO L272 TraceCheckUtils]: 59: Hoare triple {6931#(= 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)); {6911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:49,361 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6723#true} {6931#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {6931#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:49,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,362 INFO L272 TraceCheckUtils]: 54: Hoare triple {6931#(= 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)); {6723#true} is VALID [2022-04-08 10:44:49,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {6931#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {6931#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:49,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {6953#(= (+ 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; {6931#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:49,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {6953#(= (+ 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); {6953#(= (+ 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-08 10:44:49,581 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6723#true} {6953#(= (+ 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)))))} #71#return; {6953#(= (+ 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-08 10:44:49,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,581 INFO L272 TraceCheckUtils]: 46: Hoare triple {6953#(= (+ 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)); {6723#true} is VALID [2022-04-08 10:44:49,582 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6723#true} {6953#(= (+ 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)))))} #69#return; {6953#(= (+ 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-08 10:44:49,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,582 INFO L272 TraceCheckUtils]: 41: Hoare triple {6953#(= (+ 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)); {6723#true} is VALID [2022-04-08 10:44:49,583 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6723#true} {6953#(= (+ 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)))))} #67#return; {6953#(= (+ 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-08 10:44:49,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,583 INFO L272 TraceCheckUtils]: 36: Hoare triple {6953#(= (+ 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)); {6723#true} is VALID [2022-04-08 10:44:49,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {6953#(= (+ 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; {6953#(= (+ 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-08 10:44:49,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {7008#(= (+ (* 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))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6953#(= (+ 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-08 10:44:49,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {7008#(= (+ (* 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))} assume !!(~a~0 != ~b~0); {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,848 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6723#true} {7008#(= (+ (* 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))} #71#return; {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L272 TraceCheckUtils]: 28: Hoare triple {7008#(= (+ (* 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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6723#true} {7008#(= (+ (* 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))} #69#return; {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,849 INFO L272 TraceCheckUtils]: 23: Hoare triple {7008#(= (+ (* 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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:49,850 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6723#true} {7008#(= (+ (* 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))} #67#return; {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {7008#(= (+ (* 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))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7008#(= (+ (* 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))} assume !false; {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {6723#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7008#(= (+ (* 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))} is VALID [2022-04-08 10:44:49,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6723#true} {6723#true} #65#return; {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {6723#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6723#true} {6723#true} #63#return; {6723#true} is VALID [2022-04-08 10:44:49,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {6723#true} assume !(0 == ~cond); {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {6723#true} ~cond := #in~cond; {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {6723#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {6723#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {6723#true} call #t~ret6 := main(); {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6723#true} {6723#true} #81#return; {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {6723#true} assume true; {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {6723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {6723#true} call ULTIMATE.init(); {6723#true} is VALID [2022-04-08 10:44:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 10:44:49,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:49,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378937233] [2022-04-08 10:44:49,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:49,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391925629] [2022-04-08 10:44:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391925629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:44:49,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:44:49,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2022-04-08 10:44:49,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201286869] [2022-04-08 10:44:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201286869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:49,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:49,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:44:49,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972175310] [2022-04-08 10:44:49,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:49,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-08 10:44:49,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:49,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:49,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:49,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:44:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:44:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:44:49,898 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:51,017 INFO L93 Difference]: Finished difference Result 163 states and 201 transitions. [2022-04-08 10:44:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:44:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-08 10:44:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-04-08 10:44:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2022-04-08 10:44:51,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2022-04-08 10:44:51,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:51,076 INFO L225 Difference]: With dead ends: 163 [2022-04-08 10:44:51,076 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 10:44:51,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:44:51,077 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:44:51,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 174 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:44:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 10:44:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2022-04-08 10:44:51,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:51,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 10:44:51,250 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 10:44:51,250 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 10:44:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:51,259 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:44:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:44:51,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:51,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:51,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) Second operand 161 states. [2022-04-08 10:44:51,260 INFO L87 Difference]: Start difference. First operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) Second operand 161 states. [2022-04-08 10:44:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:51,263 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-08 10:44:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-08 10:44:51,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:51,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:51,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:51,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 40 states have call successors, (40), 20 states have call predecessors, (40), 19 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 10:44:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-04-08 10:44:51,267 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 63 [2022-04-08 10:44:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:51,268 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-04-08 10:44:51,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:51,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 178 transitions. [2022-04-08 10:44:51,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-04-08 10:44:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 10:44:51,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:51,537 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:51,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:44:51,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:44:51,737 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -522529, now seen corresponding path program 3 times [2022-04-08 10:44:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:51,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240163471] [2022-04-08 10:44:51,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash -522529, now seen corresponding path program 4 times [2022-04-08 10:44:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:51,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680749372] [2022-04-08 10:44:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:51,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:51,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878237207] [2022-04-08 10:44:51,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:44:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:51,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:51,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 10:44:51,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:44:51,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:51,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:44:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:51,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:52,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {8059#true} call ULTIMATE.init(); {8059#true} is VALID [2022-04-08 10:44:52,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8059#true} is VALID [2022-04-08 10:44:52,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8059#true} {8059#true} #81#return; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {8059#true} call #t~ret6 := main(); {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {8059#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {8059#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8059#true} {8059#true} #63#return; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L272 TraceCheckUtils]: 11: Hoare triple {8059#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8059#true} {8059#true} #65#return; {8059#true} is VALID [2022-04-08 10:44:52,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {8059#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8112#(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-08 10:44:52,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {8112#(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; {8112#(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-08 10:44:52,228 INFO L272 TraceCheckUtils]: 18: Hoare triple {8112#(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)); {8059#true} is VALID [2022-04-08 10:44:52,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,229 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8059#true} {8112#(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))} #67#return; {8112#(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-08 10:44:52,229 INFO L272 TraceCheckUtils]: 23: Hoare triple {8112#(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)); {8059#true} is VALID [2022-04-08 10:44:52,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,230 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8059#true} {8112#(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))} #69#return; {8112#(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-08 10:44:52,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {8112#(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)); {8059#true} is VALID [2022-04-08 10:44:52,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,231 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8059#true} {8112#(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))} #71#return; {8112#(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-08 10:44:52,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {8112#(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); {8112#(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-08 10:44:52,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {8112#(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; {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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; {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,232 INFO L272 TraceCheckUtils]: 36: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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)); {8059#true} is VALID [2022-04-08 10:44:52,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,233 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8059#true} {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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))} #67#return; {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,233 INFO L272 TraceCheckUtils]: 41: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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)); {8059#true} is VALID [2022-04-08 10:44:52,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,234 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8059#true} {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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))} #69#return; {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,234 INFO L272 TraceCheckUtils]: 46: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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)); {8059#true} is VALID [2022-04-08 10:44:52,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,234 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8059#true} {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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))} #71#return; {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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); {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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-08 10:44:52,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {8167#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= 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; {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-08 10:44:52,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} assume !false; {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-08 10:44:52,236 INFO L272 TraceCheckUtils]: 54: Hoare triple {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8059#true} is VALID [2022-04-08 10:44:52,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,237 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8059#true} {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} #67#return; {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-08 10:44:52,238 INFO L272 TraceCheckUtils]: 59: Hoare triple {8222#(and (= main_~a~0 (+ (* main_~x~0 2) (* (- 1) main_~y~0))) (= main_~p~0 2) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:52,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {8244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:52,238 INFO L290 TraceCheckUtils]: 61: Hoare triple {8248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8060#false} is VALID [2022-04-08 10:44:52,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {8060#false} assume !false; {8060#false} is VALID [2022-04-08 10:44:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 10:44:52,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:44:52,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {8060#false} assume !false; {8060#false} is VALID [2022-04-08 10:44:52,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {8248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8060#false} is VALID [2022-04-08 10:44:52,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {8244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:52,501 INFO L272 TraceCheckUtils]: 59: Hoare triple {8264#(= 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)); {8244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:52,502 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8059#true} {8264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {8264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:52,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,502 INFO L272 TraceCheckUtils]: 54: Hoare triple {8264#(= 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)); {8059#true} is VALID [2022-04-08 10:44:52,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {8264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {8264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:52,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {8286#(= (+ 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; {8264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:44:52,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {8286#(= (+ 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); {8286#(= (+ 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-08 10:44:52,960 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8059#true} {8286#(= (+ 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)))))} #71#return; {8286#(= (+ 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-08 10:44:52,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,960 INFO L272 TraceCheckUtils]: 46: Hoare triple {8286#(= (+ 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)); {8059#true} is VALID [2022-04-08 10:44:52,961 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8059#true} {8286#(= (+ 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)))))} #69#return; {8286#(= (+ 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-08 10:44:52,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,961 INFO L272 TraceCheckUtils]: 41: Hoare triple {8286#(= (+ 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)); {8059#true} is VALID [2022-04-08 10:44:52,962 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8059#true} {8286#(= (+ 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)))))} #67#return; {8286#(= (+ 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-08 10:44:52,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:52,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:52,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:52,962 INFO L272 TraceCheckUtils]: 36: Hoare triple {8286#(= (+ 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)); {8059#true} is VALID [2022-04-08 10:44:52,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {8286#(= (+ 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; {8286#(= (+ 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-08 10:44:53,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {8341#(= (+ (* (+ (* 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; {8286#(= (+ 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-08 10:44:53,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {8341#(= (+ (* (+ (* 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); {8341#(= (+ (* (+ (* 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-08 10:44:53,844 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8059#true} {8341#(= (+ (* (+ (* 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)))} #71#return; {8341#(= (+ (* (+ (* 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-08 10:44:53,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L272 TraceCheckUtils]: 28: Hoare triple {8341#(= (+ (* (+ (* 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)); {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8059#true} {8341#(= (+ (* (+ (* 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)))} #69#return; {8341#(= (+ (* (+ (* 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-08 10:44:53,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:53,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:53,846 INFO L272 TraceCheckUtils]: 23: Hoare triple {8341#(= (+ (* (+ (* 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)); {8059#true} is VALID [2022-04-08 10:44:53,846 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8059#true} {8341#(= (+ (* (+ (* 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)))} #67#return; {8341#(= (+ (* (+ (* 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-08 10:44:53,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:53,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:53,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {8341#(= (+ (* (+ (* 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)); {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(= (+ (* (+ (* 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; {8341#(= (+ (* (+ (* 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-08 10:44:53,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {8059#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8341#(= (+ (* (+ (* 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-08 10:44:53,847 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8059#true} {8059#true} #65#return; {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {8059#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8059#true} {8059#true} #63#return; {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {8059#true} assume !(0 == ~cond); {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {8059#true} ~cond := #in~cond; {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {8059#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {8059#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {8059#true} call #t~ret6 := main(); {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8059#true} {8059#true} #81#return; {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {8059#true} assume true; {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {8059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {8059#true} call ULTIMATE.init(); {8059#true} is VALID [2022-04-08 10:44:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 10:44:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:44:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680749372] [2022-04-08 10:44:53,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:44:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878237207] [2022-04-08 10:44:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878237207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:44:53,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:44:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 10:44:53,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:44:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240163471] [2022-04-08 10:44:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240163471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:44:53,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:44:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:44:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166199259] [2022-04-08 10:44:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:44:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-08 10:44:53,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:44:53,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:53,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:53,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:44:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:53,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:44:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:44:53,888 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:54,589 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-04-08 10:44:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:44:54,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-08 10:44:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:44:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 10:44:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-08 10:44:54,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-08 10:44:54,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:54,670 INFO L225 Difference]: With dead ends: 185 [2022-04-08 10:44:54,670 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 10:44:54,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:44:54,671 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:44:54,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:44:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 10:44:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2022-04-08 10:44:54,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:44:54,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 10:44:54,810 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 10:44:54,810 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 10:44:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:54,814 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2022-04-08 10:44:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 221 transitions. [2022-04-08 10:44:54,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:54,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:54,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 183 states. [2022-04-08 10:44:54,815 INFO L87 Difference]: Start difference. First operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 183 states. [2022-04-08 10:44:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:44:54,818 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2022-04-08 10:44:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 221 transitions. [2022-04-08 10:44:54,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:44:54,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:44:54,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:44:54,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:44:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 105 states have internal predecessors, (116), 43 states have call successors, (43), 24 states have call predecessors, (43), 23 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 10:44:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2022-04-08 10:44:54,822 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 63 [2022-04-08 10:44:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:44:54,822 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2022-04-08 10:44:54,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-08 10:44:54,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 200 transitions. [2022-04-08 10:44:55,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:44:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2022-04-08 10:44:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 10:44:55,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:44:55,083 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:44:55,101 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-08 10:44:55,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 10:44:55,284 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:44:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:44:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1383919957, now seen corresponding path program 5 times [2022-04-08 10:44:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:44:55,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221355512] [2022-04-08 10:44:55,285 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:44:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1383919957, now seen corresponding path program 6 times [2022-04-08 10:44:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:44:55,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664579934] [2022-04-08 10:44:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:44:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:44:55,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:44:55,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551291004] [2022-04-08 10:44:55,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:44:55,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:44:55,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:44:55,304 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:44:55,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:44:55,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:44:55,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:44:55,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:44:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:44:55,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:44:55,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {9522#true} call ULTIMATE.init(); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {9522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9522#true} {9522#true} #81#return; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {9522#true} call #t~ret6 := main(); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {9522#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {9522#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9522#true} {9522#true} #63#return; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L272 TraceCheckUtils]: 11: Hoare triple {9522#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,875 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9522#true} {9522#true} #65#return; {9522#true} is VALID [2022-04-08 10:44:55,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {9522#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9575#(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-08 10:44:55,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {9575#(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; {9575#(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-08 10:44:55,876 INFO L272 TraceCheckUtils]: 18: Hoare triple {9575#(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)); {9522#true} is VALID [2022-04-08 10:44:55,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,877 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9522#true} {9575#(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))} #67#return; {9575#(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-08 10:44:55,877 INFO L272 TraceCheckUtils]: 23: Hoare triple {9575#(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)); {9522#true} is VALID [2022-04-08 10:44:55,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,878 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9522#true} {9575#(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))} #69#return; {9575#(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-08 10:44:55,878 INFO L272 TraceCheckUtils]: 28: Hoare triple {9575#(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)); {9522#true} is VALID [2022-04-08 10:44:55,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,878 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9522#true} {9575#(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))} #71#return; {9575#(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-08 10:44:55,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {9575#(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); {9575#(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-08 10:44:55,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {9575#(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; {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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; {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,880 INFO L272 TraceCheckUtils]: 36: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)); {9522#true} is VALID [2022-04-08 10:44:55,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,881 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9522#true} {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)))} #67#return; {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,881 INFO L272 TraceCheckUtils]: 41: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)); {9522#true} is VALID [2022-04-08 10:44:55,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {9522#true} ~cond := #in~cond; {9655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:55,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {9655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:55,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:44:55,882 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)))} #69#return; {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,882 INFO L272 TraceCheckUtils]: 46: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)); {9522#true} is VALID [2022-04-08 10:44:55,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,883 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9522#true} {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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)))} #71#return; {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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); {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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-08 10:44:55,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {9630#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~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);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} is VALID [2022-04-08 10:44:55,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} assume !false; {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} is VALID [2022-04-08 10:44:55,886 INFO L272 TraceCheckUtils]: 54: Hoare triple {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L290 TraceCheckUtils]: 55: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9522#true} {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} #67#return; {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} is VALID [2022-04-08 10:44:55,886 INFO L272 TraceCheckUtils]: 59: Hoare triple {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:44:55,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:44:55,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:44:55,887 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9522#true} {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} #69#return; {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} is VALID [2022-04-08 10:44:55,888 INFO L272 TraceCheckUtils]: 64: Hoare triple {9687#(and (= main_~x~0 (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (= (- 1) main_~q~0) (= (- 1) (+ (* (- 1) main_~s~0) 1)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:44:55,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {9724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:44:55,888 INFO L290 TraceCheckUtils]: 66: Hoare triple {9728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9523#false} is VALID [2022-04-08 10:44:55,889 INFO L290 TraceCheckUtils]: 67: Hoare triple {9523#false} assume !false; {9523#false} is VALID [2022-04-08 10:44:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-08 10:44:55,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:45:10,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {9523#false} assume !false; {9523#false} is VALID [2022-04-08 10:45:10,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {9728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9523#false} is VALID [2022-04-08 10:45:10,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {9724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:10,811 INFO L272 TraceCheckUtils]: 64: Hoare triple {9744#(= 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)); {9724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:10,811 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9522#true} {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:10,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {9744#(= 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)); {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9522#true} {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:10,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:10,812 INFO L272 TraceCheckUtils]: 54: Hoare triple {9744#(= 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)); {9522#true} is VALID [2022-04-08 10:45:10,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:10,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {9781#(= (+ (* (+ 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; {9744#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:10,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {9781#(= (+ (* (+ 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); {9781#(= (+ (* (+ 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-08 10:45:10,957 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9522#true} {9781#(= (+ (* (+ 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))} #71#return; {9781#(= (+ (* (+ 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-08 10:45:10,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:10,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:10,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:10,957 INFO L272 TraceCheckUtils]: 46: Hoare triple {9781#(= (+ (* (+ 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)); {9522#true} is VALID [2022-04-08 10:45:10,958 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)))} #69#return; {9781#(= (+ (* (+ 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-08 10:45:10,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:10,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {9813#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:10,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {9522#true} ~cond := #in~cond; {9813#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:45:10,959 INFO L272 TraceCheckUtils]: 41: Hoare triple {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)); {9522#true} is VALID [2022-04-08 10:45:10,960 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9522#true} {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)))} #67#return; {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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-08 10:45:10,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:10,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:10,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:10,960 INFO L272 TraceCheckUtils]: 36: Hoare triple {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)); {9522#true} is VALID [2022-04-08 10:45:10,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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; {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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-08 10:45:12,964 WARN L290 TraceCheckUtils]: 34: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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; {9803#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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-08 10:45:12,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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); {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,966 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9522#true} {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)))))))} #71#return; {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:12,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:12,966 INFO L272 TraceCheckUtils]: 28: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)); {9522#true} is VALID [2022-04-08 10:45:12,967 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9522#true} {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)))))))} #69#return; {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:12,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:12,967 INFO L272 TraceCheckUtils]: 23: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)); {9522#true} is VALID [2022-04-08 10:45:12,967 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9522#true} {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)))))))} #67#return; {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:12,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:12,968 INFO L272 TraceCheckUtils]: 18: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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)); {9522#true} is VALID [2022-04-08 10:45:12,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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; {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {9522#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9838#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ main_~b~0 (* (- 1) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0)) (* (- 1) (* main_~x~0 (+ main_~p~0 (* (- 1) 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-08 10:45:12,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9522#true} {9522#true} #65#return; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {9522#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9522#true} {9522#true} #63#return; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {9522#true} assume !(0 == ~cond); {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {9522#true} ~cond := #in~cond; {9522#true} is VALID [2022-04-08 10:45:12,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {9522#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {9522#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {9522#true} call #t~ret6 := main(); {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9522#true} {9522#true} #81#return; {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {9522#true} assume true; {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {9522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {9522#true} call ULTIMATE.init(); {9522#true} is VALID [2022-04-08 10:45:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-08 10:45:12,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664579934] [2022-04-08 10:45:12,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551291004] [2022-04-08 10:45:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551291004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:45:12,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:45:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-04-08 10:45:12,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:12,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221355512] [2022-04-08 10:45:12,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221355512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:12,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:45:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348898970] [2022-04-08 10:45:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:12,984 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 68 [2022-04-08 10:45:12,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:12,985 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:13,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:13,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:45:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:45:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:45:13,041 INFO L87 Difference]: Start difference. First operand 169 states and 200 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:13,935 INFO L93 Difference]: Finished difference Result 191 states and 234 transitions. [2022-04-08 10:45:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:45:13,935 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 68 [2022-04-08 10:45:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:13,936 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-04-08 10:45:13,939 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-04-08 10:45:13,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2022-04-08 10:45:14,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:14,031 INFO L225 Difference]: With dead ends: 191 [2022-04-08 10:45:14,031 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 10:45:14,031 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:45:14,031 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:45:14,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 133 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:45:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 10:45:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2022-04-08 10:45:14,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:14,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 10:45:14,162 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 10:45:14,162 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 10:45:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:14,179 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-04-08 10:45:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2022-04-08 10:45:14,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:14,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:14,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) Second operand 185 states. [2022-04-08 10:45:14,182 INFO L87 Difference]: Start difference. First operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) Second operand 185 states. [2022-04-08 10:45:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:14,189 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-04-08 10:45:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2022-04-08 10:45:14,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:14,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:14,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:14,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 107 states have internal predecessors, (117), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 10:45:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2022-04-08 10:45:14,193 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 68 [2022-04-08 10:45:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:14,193 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2022-04-08 10:45:14,193 INFO L479 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:14,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 205 transitions. [2022-04-08 10:45:14,496 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-08 10:45:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2022-04-08 10:45:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 10:45:14,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:14,497 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:45:14,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:45:14,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:45:14,697 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -860063341, now seen corresponding path program 3 times [2022-04-08 10:45:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621901541] [2022-04-08 10:45:14,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -860063341, now seen corresponding path program 4 times [2022-04-08 10:45:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868838818] [2022-04-08 10:45:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:14,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:14,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789806839] [2022-04-08 10:45:14,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:45:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:14,710 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:45:14,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 10:45:14,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:45:14,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:14,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 10:45:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:14,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:15,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {11043#true} call ULTIMATE.init(); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {11043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11043#true} {11043#true} #81#return; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {11043#true} call #t~ret6 := main(); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {11043#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {11043#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11043#true} {11043#true} #63#return; {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L272 TraceCheckUtils]: 11: Hoare triple {11043#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:15,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11043#true} {11043#true} #65#return; {11043#true} is VALID [2022-04-08 10:45:15,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {11043#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11096#(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-08 10:45:15,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(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; {11096#(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-08 10:45:15,181 INFO L272 TraceCheckUtils]: 18: Hoare triple {11096#(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)); {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11043#true} {11096#(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))} #67#return; {11096#(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-08 10:45:15,182 INFO L272 TraceCheckUtils]: 23: Hoare triple {11096#(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)); {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,183 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11043#true} {11096#(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))} #69#return; {11096#(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-08 10:45:15,183 INFO L272 TraceCheckUtils]: 28: Hoare triple {11096#(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)); {11043#true} is VALID [2022-04-08 10:45:15,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,184 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11043#true} {11096#(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))} #71#return; {11096#(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-08 10:45:15,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {11096#(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); {11096#(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-08 10:45:15,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {11096#(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; {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,185 INFO L272 TraceCheckUtils]: 36: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~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)); {11043#true} is VALID [2022-04-08 10:45:15,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,186 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11043#true} {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #67#return; {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,186 INFO L272 TraceCheckUtils]: 41: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~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)); {11043#true} is VALID [2022-04-08 10:45:15,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,187 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11043#true} {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #69#return; {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,187 INFO L272 TraceCheckUtils]: 46: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~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)); {11043#true} is VALID [2022-04-08 10:45:15,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {11043#true} ~cond := #in~cond; {11191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:15,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {11191#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:15,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:15,188 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #71#return; {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:15,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {11151#(and (= main_~r~0 0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 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; {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 10:45:15,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} assume !false; {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 10:45:15,190 INFO L272 TraceCheckUtils]: 54: Hoare triple {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:15,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,191 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11043#true} {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #67#return; {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 10:45:15,191 INFO L272 TraceCheckUtils]: 59: Hoare triple {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:15,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:15,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:15,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:15,192 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11043#true} {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #69#return; {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 10:45:15,192 INFO L272 TraceCheckUtils]: 64: Hoare triple {11208#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:15,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {11245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:15,193 INFO L290 TraceCheckUtils]: 66: Hoare triple {11249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11044#false} is VALID [2022-04-08 10:45:15,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {11044#false} assume !false; {11044#false} is VALID [2022-04-08 10:45:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-08 10:45:15,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:45:30,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {11044#false} assume !false; {11044#false} is VALID [2022-04-08 10:45:30,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {11249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11044#false} is VALID [2022-04-08 10:45:30,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {11245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:30,072 INFO L272 TraceCheckUtils]: 64: Hoare triple {11265#(= 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)); {11245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:30,073 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11043#true} {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:30,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,073 INFO L272 TraceCheckUtils]: 59: Hoare triple {11265#(= 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)); {11043#true} is VALID [2022-04-08 10:45:30,074 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11043#true} {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:30,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,074 INFO L272 TraceCheckUtils]: 54: Hoare triple {11265#(= 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)); {11043#true} is VALID [2022-04-08 10:45:30,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:30,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {11302#(= (+ (* (+ 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; {11265#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:45:30,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {11302#(= (+ (* (+ 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); {11302#(= (+ (* (+ 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-08 10:45:30,565 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} {11309#(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)))} #71#return; {11302#(= (+ (* (+ 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-08 10:45:30,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:30,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {11319#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:30,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {11043#true} ~cond := #in~cond; {11319#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:45:30,566 INFO L272 TraceCheckUtils]: 46: Hoare triple {11309#(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)); {11043#true} is VALID [2022-04-08 10:45:30,567 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11043#true} {11309#(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)))} #69#return; {11309#(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-08 10:45:30,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,567 INFO L272 TraceCheckUtils]: 41: Hoare triple {11309#(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)); {11043#true} is VALID [2022-04-08 10:45:30,568 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11043#true} {11309#(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)))} #67#return; {11309#(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-08 10:45:30,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,568 INFO L272 TraceCheckUtils]: 36: Hoare triple {11309#(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)); {11043#true} is VALID [2022-04-08 10:45:30,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {11309#(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; {11309#(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-08 10:45:30,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {11359#(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; {11309#(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-08 10:45:30,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {11359#(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); {11359#(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-08 10:45:30,873 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11043#true} {11359#(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))))} #71#return; {11359#(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-08 10:45:30,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,873 INFO L272 TraceCheckUtils]: 28: Hoare triple {11359#(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))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:30,874 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11043#true} {11359#(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))))} #69#return; {11359#(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-08 10:45:30,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,874 INFO L272 TraceCheckUtils]: 23: Hoare triple {11359#(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))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:30,875 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11043#true} {11359#(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))))} #67#return; {11359#(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-08 10:45:30,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,875 INFO L272 TraceCheckUtils]: 18: Hoare triple {11359#(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))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(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 !false; {11359#(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-08 10:45:30,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {11043#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11359#(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-08 10:45:30,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11043#true} {11043#true} #65#return; {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {11043#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:30,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11043#true} {11043#true} #63#return; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {11043#true} assume !(0 == ~cond); {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {11043#true} ~cond := #in~cond; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {11043#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {11043#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {11043#true} call #t~ret6 := main(); {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11043#true} {11043#true} #81#return; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {11043#true} assume true; {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {11043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {11043#true} call ULTIMATE.init(); {11043#true} is VALID [2022-04-08 10:45:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-08 10:45:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868838818] [2022-04-08 10:45:30,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789806839] [2022-04-08 10:45:30,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789806839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:45:30,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:45:30,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-04-08 10:45:30,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621901541] [2022-04-08 10:45:30,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621901541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:30,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:30,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:45:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091684509] [2022-04-08 10:45:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:30,879 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 68 [2022-04-08 10:45:30,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:30,879 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:30,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:30,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:45:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:45:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:45:30,925 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:32,027 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2022-04-08 10:45:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:45:32,027 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 68 [2022-04-08 10:45:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:32,029 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-04-08 10:45:32,031 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-04-08 10:45:32,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2022-04-08 10:45:32,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:32,112 INFO L225 Difference]: With dead ends: 197 [2022-04-08 10:45:32,112 INFO L226 Difference]: Without dead ends: 188 [2022-04-08 10:45:32,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:45:32,113 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:45:32,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 130 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:45:32,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-08 10:45:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-04-08 10:45:32,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:32,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 10:45:32,238 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 10:45:32,239 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 10:45:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:32,242 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions. [2022-04-08 10:45:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2022-04-08 10:45:32,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:32,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:32,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) Second operand 188 states. [2022-04-08 10:45:32,243 INFO L87 Difference]: Start difference. First operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) Second operand 188 states. [2022-04-08 10:45:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:32,246 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions. [2022-04-08 10:45:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2022-04-08 10:45:32,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:32,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:32,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:32,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 51 states have call successors, (51), 25 states have call predecessors, (51), 24 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 10:45:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2022-04-08 10:45:32,250 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 68 [2022-04-08 10:45:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:32,251 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2022-04-08 10:45:32,251 INFO L479 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, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:45:32,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 228 transitions. [2022-04-08 10:45:32,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2022-04-08 10:45:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 10:45:32,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:32,571 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:45:32,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 10:45:32,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:45:32,772 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash -35686306, now seen corresponding path program 7 times [2022-04-08 10:45:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:32,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401977323] [2022-04-08 10:45:32,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -35686306, now seen corresponding path program 8 times [2022-04-08 10:45:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:32,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249457837] [2022-04-08 10:45:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:32,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:32,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807000897] [2022-04-08 10:45:32,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:45:32,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:32,787 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:45:32,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 10:45:32,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:45:32,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:32,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:45:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:32,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:33,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {12614#true} call ULTIMATE.init(); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12614#true} {12614#true} #81#return; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {12614#true} call #t~ret6 := main(); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {12614#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12614#true} {12614#true} #63#return; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {12614#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12614#true} {12614#true} #65#return; {12614#true} is VALID [2022-04-08 10:45:33,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {12614#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12667#(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-08 10:45:33,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {12667#(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; {12667#(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-08 10:45:33,426 INFO L272 TraceCheckUtils]: 18: Hoare triple {12667#(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)); {12614#true} is VALID [2022-04-08 10:45:33,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12614#true} {12667#(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))} #67#return; {12667#(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-08 10:45:33,427 INFO L272 TraceCheckUtils]: 23: Hoare triple {12667#(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)); {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12614#true} {12667#(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))} #69#return; {12667#(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-08 10:45:33,427 INFO L272 TraceCheckUtils]: 28: Hoare triple {12667#(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)); {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,428 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12614#true} {12667#(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))} #71#return; {12667#(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-08 10:45:33,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {12667#(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); {12667#(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-08 10:45:33,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {12667#(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; {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,429 INFO L272 TraceCheckUtils]: 36: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {12614#true} is VALID [2022-04-08 10:45:33,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,429 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12614#true} {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #67#return; {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,429 INFO L272 TraceCheckUtils]: 41: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12614#true} {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #69#return; {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,430 INFO L272 TraceCheckUtils]: 46: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,431 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12614#true} {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #71#return; {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:45:33,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {12722#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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; {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !false; {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,432 INFO L272 TraceCheckUtils]: 54: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~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)); {12614#true} is VALID [2022-04-08 10:45:33,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12614#true} {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #67#return; {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,433 INFO L272 TraceCheckUtils]: 59: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12614#true} {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #69#return; {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,433 INFO L272 TraceCheckUtils]: 64: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,434 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12614#true} {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #71#return; {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !!(~a~0 != ~b~0); {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:45:33,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {12777#(and (= (* (- 2) main_~s~0) main_~r~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) 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; {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:33,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} assume !false; {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:33,435 INFO L272 TraceCheckUtils]: 72: Hoare triple {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:33,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,436 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12614#true} {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} #67#return; {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:33,436 INFO L272 TraceCheckUtils]: 77: Hoare triple {12832#(and (= main_~r~0 (- 3)) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:33,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {12854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:33,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {12858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12615#false} is VALID [2022-04-08 10:45:33,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2022-04-08 10:45:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 10:45:33,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:45:33,850 INFO L290 TraceCheckUtils]: 80: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2022-04-08 10:45:33,851 INFO L290 TraceCheckUtils]: 79: Hoare triple {12858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12615#false} is VALID [2022-04-08 10:45:33,851 INFO L290 TraceCheckUtils]: 78: Hoare triple {12854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:33,852 INFO L272 TraceCheckUtils]: 77: Hoare triple {12874#(= 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)); {12854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:33,852 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12614#true} {12874#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {12874#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:45:33,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:33,852 INFO L290 TraceCheckUtils]: 74: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:33,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:33,852 INFO L272 TraceCheckUtils]: 72: Hoare triple {12874#(= 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)); {12614#true} is VALID [2022-04-08 10:45:33,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {12874#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12874#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:45:34,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {12896#(= (+ 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; {12874#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:45:34,057 INFO L290 TraceCheckUtils]: 69: Hoare triple {12896#(= (+ 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); {12896#(= (+ 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-08 10:45:34,057 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12614#true} {12896#(= (+ 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)))))} #71#return; {12896#(= (+ 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-08 10:45:34,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L272 TraceCheckUtils]: 64: Hoare triple {12896#(= (+ 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)); {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12614#true} {12896#(= (+ 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)))))} #69#return; {12896#(= (+ 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-08 10:45:34,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,059 INFO L272 TraceCheckUtils]: 59: Hoare triple {12896#(= (+ 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)); {12614#true} is VALID [2022-04-08 10:45:34,059 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12614#true} {12896#(= (+ 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)))))} #67#return; {12896#(= (+ 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-08 10:45:34,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,059 INFO L272 TraceCheckUtils]: 54: Hoare triple {12896#(= (+ 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)); {12614#true} is VALID [2022-04-08 10:45:34,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {12896#(= (+ 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; {12896#(= (+ 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-08 10:45:34,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {12951#(= (+ (* 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))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12896#(= (+ 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-08 10:45:34,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {12951#(= (+ (* 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))} assume !!(~a~0 != ~b~0); {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,122 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12614#true} {12951#(= (+ (* 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))} #71#return; {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,122 INFO L272 TraceCheckUtils]: 46: Hoare triple {12951#(= (+ (* 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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,122 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12614#true} {12951#(= (+ (* 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))} #69#return; {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,123 INFO L272 TraceCheckUtils]: 41: Hoare triple {12951#(= (+ (* 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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,123 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12614#true} {12951#(= (+ (* 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))} #67#return; {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,124 INFO L272 TraceCheckUtils]: 36: Hoare triple {12951#(= (+ (* 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))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {12951#(= (+ (* 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))} assume !false; {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) 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; {12951#(= (+ (* 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))} is VALID [2022-04-08 10:45:34,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} assume !!(~a~0 != ~b~0); {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,308 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12614#true} {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} #71#return; {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,308 INFO L272 TraceCheckUtils]: 28: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,308 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12614#true} {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} #69#return; {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L272 TraceCheckUtils]: 23: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12614#true} {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} #67#return; {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,309 INFO L272 TraceCheckUtils]: 18: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} assume !false; {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {12614#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13006#(= (+ (* main_~x~0 (+ (* main_~q~0 (- 3)) main_~p~0)) (* main_~y~0 (+ main_~r~0 (* main_~s~0 (- 3))))) (+ (* main_~b~0 (- 3)) main_~a~0))} is VALID [2022-04-08 10:45:34,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12614#true} {12614#true} #65#return; {12614#true} is VALID [2022-04-08 10:45:34,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {12614#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12614#true} {12614#true} #63#return; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#true} assume !(0 == ~cond); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#true} ~cond := #in~cond; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {12614#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {12614#true} call #t~ret6 := main(); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12614#true} {12614#true} #81#return; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12614#true} is VALID [2022-04-08 10:45:34,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {12614#true} call ULTIMATE.init(); {12614#true} is VALID [2022-04-08 10:45:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 10:45:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:45:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249457837] [2022-04-08 10:45:34,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:45:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807000897] [2022-04-08 10:45:34,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807000897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:45:34,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:45:34,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-08 10:45:34,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:45:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401977323] [2022-04-08 10:45:34,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401977323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:45:34,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:45:34,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:45:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371983586] [2022-04-08 10:45:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:45:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2022-04-08 10:45:34,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:45:34,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 10:45:34,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:34,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:45:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:34,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:45:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:45:34,363 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 10:45:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:35,644 INFO L93 Difference]: Finished difference Result 222 states and 270 transitions. [2022-04-08 10:45:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:45:35,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2022-04-08 10:45:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:45:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 10:45:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 10:45:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 10:45:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 10:45:35,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-08 10:45:35,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:35,746 INFO L225 Difference]: With dead ends: 222 [2022-04-08 10:45:35,746 INFO L226 Difference]: Without dead ends: 220 [2022-04-08 10:45:35,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:45:35,747 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:45:35,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 200 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:45:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-04-08 10:45:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2022-04-08 10:45:35,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:45:35,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-08 10:45:35,960 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-08 10:45:35,960 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-08 10:45:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:35,964 INFO L93 Difference]: Finished difference Result 220 states and 268 transitions. [2022-04-08 10:45:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2022-04-08 10:45:35,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:35,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:35,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) Second operand 220 states. [2022-04-08 10:45:35,965 INFO L87 Difference]: Start difference. First operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) Second operand 220 states. [2022-04-08 10:45:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:45:35,970 INFO L93 Difference]: Finished difference Result 220 states and 268 transitions. [2022-04-08 10:45:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2022-04-08 10:45:35,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:45:35,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:45:35,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:45:35,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:45:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.146153846153846) internal successors, (149), 134 states have internal predecessors, (149), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-08 10:45:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2022-04-08 10:45:35,975 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 81 [2022-04-08 10:45:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:45:35,976 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2022-04-08 10:45:35,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 10:45:35,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 261 transitions. [2022-04-08 10:45:36,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:45:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2022-04-08 10:45:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 10:45:36,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:45:36,555 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 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] [2022-04-08 10:45:36,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:45:36,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:36,756 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:45:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:45:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1350517088, now seen corresponding path program 7 times [2022-04-08 10:45:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:45:36,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641826998] [2022-04-08 10:45:36,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:45:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1350517088, now seen corresponding path program 8 times [2022-04-08 10:45:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:45:36,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428771735] [2022-04-08 10:45:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:45:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:45:36,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:45:36,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929118420] [2022-04-08 10:45:36,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:45:36,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:45:36,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:45:36,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:45:36,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 10:45:36,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:45:36,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:45:36,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:45:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:45:36,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:45:40,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {14429#true} call ULTIMATE.init(); {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {14429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14429#true} {14429#true} #81#return; {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {14429#true} call #t~ret6 := main(); {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {14429#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {14429#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:45:40,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14429#true} {14429#true} #63#return; {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {14429#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14429#true} {14429#true} #65#return; {14429#true} is VALID [2022-04-08 10:45:40,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {14429#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,738 INFO L272 TraceCheckUtils]: 18: Hoare triple {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= 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)); {14429#true} is VALID [2022-04-08 10:45:40,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,739 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14429#true} {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,739 INFO L272 TraceCheckUtils]: 23: Hoare triple {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= 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)); {14429#true} is VALID [2022-04-08 10:45:40,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {14429#true} ~cond := #in~cond; {14507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:40,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {14507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:40,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:40,745 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} {14482#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,745 INFO L272 TraceCheckUtils]: 28: Hoare triple {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:45:40,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,746 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14429#true} {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} #71#return; {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {14518#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:45:40,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {14518#(and (= main_~r~0 0) (= 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) (= 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; {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} assume !false; {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,748 INFO L272 TraceCheckUtils]: 36: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {14429#true} is VALID [2022-04-08 10:45:40,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,749 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14429#true} {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #67#return; {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,749 INFO L272 TraceCheckUtils]: 41: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {14429#true} is VALID [2022-04-08 10:45:40,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,749 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14429#true} {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #69#return; {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,750 INFO L272 TraceCheckUtils]: 46: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {14429#true} is VALID [2022-04-08 10:45:40,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,750 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14429#true} {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #71#return; {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:45:40,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {14540#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (< 0 main_~a~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 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; {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:40,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:40,753 INFO L272 TraceCheckUtils]: 54: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~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)); {14429#true} is VALID [2022-04-08 10:45:40,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,754 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14429#true} {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #67#return; {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:40,754 INFO L272 TraceCheckUtils]: 59: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~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)); {14429#true} is VALID [2022-04-08 10:45:40,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:40,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:40,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:40,754 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14429#true} {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #69#return; {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:40,755 INFO L272 TraceCheckUtils]: 64: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~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)); {14429#true} is VALID [2022-04-08 10:45:40,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {14429#true} ~cond := #in~cond; {14507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:40,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {14507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:40,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:45:40,756 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #71#return; {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:40,757 INFO L290 TraceCheckUtils]: 69: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(~a~0 != ~b~0); {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 10:45:41,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {14595#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (not (< main_~b~0 0)) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ (* main_~y~0 (+ main_~s~0 (* main_~r~0 2))) (* (+ (* main_~p~0 2) main_~q~0) main_~x~0)) (+ (* main_~a~0 2) main_~b~0)) (< 0 main_~a~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; {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} is VALID [2022-04-08 10:45:41,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} assume !false; {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} is VALID [2022-04-08 10:45:41,092 INFO L272 TraceCheckUtils]: 72: Hoare triple {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:45:41,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:45:41,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:45:41,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:45:41,093 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14429#true} {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} #67#return; {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} is VALID [2022-04-08 10:45:41,131 INFO L272 TraceCheckUtils]: 77: Hoare triple {14650#(and (= (mod (+ main_~a~0 main_~y~0) 2) 0) (not (< (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 0)) (= main_~r~0 (- 3)) (= (* main_~x~0 (+ (* main_~p~0 2) (* 3 (div (+ (* (- 2) main_~p~0) 1) 3)))) (+ (* (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) 3) (* main_~a~0 2))) (= (mod (+ main_~p~0 1) 3) 0) (= (+ main_~p~0 (* 2 (div (+ (* (- 2) main_~p~0) 1) 3))) 0) (< 0 (+ (div (+ main_~a~0 (* (- 1) main_~y~0)) (- 2)) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:45:41,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:45:41,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {14676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14430#false} is VALID [2022-04-08 10:45:41,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {14430#false} assume !false; {14430#false} is VALID [2022-04-08 10:45:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 42 proven. 53 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:45:41,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:46:33,419 INFO L290 TraceCheckUtils]: 80: Hoare triple {14430#false} assume !false; {14430#false} is VALID [2022-04-08 10:46:33,420 INFO L290 TraceCheckUtils]: 79: Hoare triple {14676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14430#false} is VALID [2022-04-08 10:46:33,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:46:33,421 INFO L272 TraceCheckUtils]: 77: Hoare triple {14692#(= 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)); {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:46:33,421 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14429#true} {14692#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {14692#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:46:33,421 INFO L290 TraceCheckUtils]: 75: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:33,421 INFO L290 TraceCheckUtils]: 74: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:33,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:33,421 INFO L272 TraceCheckUtils]: 72: Hoare triple {14692#(= 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)); {14429#true} is VALID [2022-04-08 10:46:33,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {14692#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {14692#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:46:33,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {14714#(= (+ 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; {14692#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:46:33,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {14714#(= (+ 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); {14714#(= (+ 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-08 10:46:33,961 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} {14721#(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)))))} #71#return; {14714#(= (+ 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-08 10:46:33,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:33,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {14731#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:33,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {14429#true} ~cond := #in~cond; {14731#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:46:33,962 INFO L272 TraceCheckUtils]: 64: Hoare triple {14721#(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)); {14429#true} is VALID [2022-04-08 10:46:33,963 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14429#true} {14721#(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)))))} #69#return; {14721#(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-08 10:46:33,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:33,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:33,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:33,963 INFO L272 TraceCheckUtils]: 59: Hoare triple {14721#(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 ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:33,963 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14429#true} {14721#(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)))))} #67#return; {14721#(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-08 10:46:33,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:33,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:33,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:33,964 INFO L272 TraceCheckUtils]: 54: Hoare triple {14721#(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 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:33,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {14721#(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)))))} assume !false; {14721#(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-08 10:46:35,966 WARN L290 TraceCheckUtils]: 52: Hoare triple {14771#(or (< 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; {14721#(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 UNKNOWN [2022-04-08 10:46:35,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {14771#(or (< 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); {14771#(or (< 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-08 10:46:35,968 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14429#true} {14771#(or (< 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))))} #71#return; {14771#(or (< 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-08 10:46:35,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:35,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:35,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:35,968 INFO L272 TraceCheckUtils]: 46: Hoare triple {14771#(or (< 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)); {14429#true} is VALID [2022-04-08 10:46:35,968 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14429#true} {14771#(or (< 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))))} #69#return; {14771#(or (< 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-08 10:46:35,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L272 TraceCheckUtils]: 41: Hoare triple {14771#(or (< 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)); {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {14429#true} {14771#(or (< 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))))} #67#return; {14771#(or (< 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-08 10:46:35,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:35,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:35,970 INFO L272 TraceCheckUtils]: 36: Hoare triple {14771#(or (< 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)); {14429#true} is VALID [2022-04-08 10:46:35,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {14771#(or (< 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; {14771#(or (< 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-08 10:46:37,972 WARN L290 TraceCheckUtils]: 34: Hoare triple {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~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; {14771#(or (< 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 UNKNOWN [2022-04-08 10:46:37,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} assume !!(~a~0 != ~b~0); {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} is VALID [2022-04-08 10:46:37,974 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14429#true} {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} #71#return; {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} is VALID [2022-04-08 10:46:37,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:37,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:37,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:37,974 INFO L272 TraceCheckUtils]: 28: Hoare triple {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:37,976 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} {14429#true} #69#return; {14826#(or (= (+ (* main_~y~0 (+ (* main_~s~0 (- 3)) (* main_~r~0 2))) (* main_~x~0 (+ (* main_~p~0 2) (* main_~q~0 (- 3))))) (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* (- 2) main_~q~0 main_~x~0)) (* 2 (* main_~p~0 main_~x~0)) (* (* (- 2) main_~y~0 main_~s~0) 2))) (not (< main_~b~0 main_~a~0)) (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (- 2) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)))))} is VALID [2022-04-08 10:46:37,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:37,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {14731#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {14429#true} ~cond := #in~cond; {14731#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:46:37,977 INFO L272 TraceCheckUtils]: 23: Hoare triple {14429#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14429#true} {14429#true} #67#return; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L272 TraceCheckUtils]: 18: Hoare triple {14429#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {14429#true} assume !false; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {14429#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14429#true} {14429#true} #65#return; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L272 TraceCheckUtils]: 11: Hoare triple {14429#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14429#true} {14429#true} #63#return; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {14429#true} assume !(0 == ~cond); {14429#true} is VALID [2022-04-08 10:46:37,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {14429#true} ~cond := #in~cond; {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {14429#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {14429#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {14429#true} call #t~ret6 := main(); {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14429#true} {14429#true} #81#return; {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {14429#true} assume true; {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {14429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {14429#true} call ULTIMATE.init(); {14429#true} is VALID [2022-04-08 10:46:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 59 proven. 36 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 10:46:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:46:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428771735] [2022-04-08 10:46:37,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:46:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929118420] [2022-04-08 10:46:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929118420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:46:37,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:46:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-08 10:46:37,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:46:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641826998] [2022-04-08 10:46:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641826998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:46:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:46:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:46:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915061266] [2022-04-08 10:46:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:46:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2022-04-08 10:46:37,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:46:37,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:46:38,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:46:38,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:46:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:46:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:46:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:46:38,373 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:46:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:46:49,723 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2022-04-08 10:46:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:46:49,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2022-04-08 10:46:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:46:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:46:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-08 10:46:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:46:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-08 10:46:49,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 90 transitions. [2022-04-08 10:46:50,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:46:50,304 INFO L225 Difference]: With dead ends: 257 [2022-04-08 10:46:50,304 INFO L226 Difference]: Without dead ends: 255 [2022-04-08 10:46:50,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:46:50,305 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:46:50,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 181 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-08 10:46:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-08 10:46:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 221. [2022-04-08 10:46:50,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:46:50,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 10:46:50,595 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 10:46:50,605 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 10:46:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:46:50,610 INFO L93 Difference]: Finished difference Result 255 states and 309 transitions. [2022-04-08 10:46:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 309 transitions. [2022-04-08 10:46:50,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:46:50,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:46:50,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) Second operand 255 states. [2022-04-08 10:46:50,611 INFO L87 Difference]: Start difference. First operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) Second operand 255 states. [2022-04-08 10:46:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:46:50,631 INFO L93 Difference]: Finished difference Result 255 states and 309 transitions. [2022-04-08 10:46:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 309 transitions. [2022-04-08 10:46:50,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:46:50,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:46:50,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:46:50,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:46:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 10:46:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2022-04-08 10:46:50,636 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 81 [2022-04-08 10:46:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:46:50,636 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2022-04-08 10:46:50,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:46:50,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 261 transitions. [2022-04-08 10:46:51,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:46:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2022-04-08 10:46:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 10:46:51,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:46:51,478 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 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] [2022-04-08 10:46:51,495 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-08 10:46:51,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:46:51,691 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:46:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:46:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -388774688, now seen corresponding path program 9 times [2022-04-08 10:46:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:46:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438611054] [2022-04-08 10:46:51,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:46:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -388774688, now seen corresponding path program 10 times [2022-04-08 10:46:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:46:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981938273] [2022-04-08 10:46:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:46:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:46:51,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:46:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926484967] [2022-04-08 10:46:51,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:46:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:46:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:46:51,720 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:46:51,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 10:46:51,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:46:51,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:46:51,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:46:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:46:51,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:46:52,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {16401#true} call ULTIMATE.init(); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {16401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16401#true} {16401#true} #81#return; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {16401#true} call #t~ret6 := main(); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {16401#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {16401#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16401#true} {16401#true} #63#return; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {16401#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16401#true} {16401#true} #65#return; {16401#true} is VALID [2022-04-08 10:46:52,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {16401#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,610 INFO L272 TraceCheckUtils]: 18: Hoare triple {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= 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)); {16401#true} is VALID [2022-04-08 10:46:52,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,611 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16401#true} {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #67#return; {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,611 INFO L272 TraceCheckUtils]: 23: Hoare triple {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= 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)); {16401#true} is VALID [2022-04-08 10:46:52,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,611 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16401#true} {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #69#return; {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,611 INFO L272 TraceCheckUtils]: 28: Hoare triple {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= 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)); {16401#true} is VALID [2022-04-08 10:46:52,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {16401#true} ~cond := #in~cond; {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:46:52,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,613 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} {16454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #71#return; {16505#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {16505#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16505#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:46:52,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {16505#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} assume !false; {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,614 INFO L272 TraceCheckUtils]: 36: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16401#true} {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} #67#return; {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,615 INFO L272 TraceCheckUtils]: 41: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,616 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16401#true} {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} #69#return; {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,616 INFO L272 TraceCheckUtils]: 46: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,616 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16401#true} {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} #71#return; {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} assume !!(~a~0 != ~b~0); {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} is VALID [2022-04-08 10:46:52,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {16512#(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) (= main_~a~0 main_~x~0) (= main_~q~0 (* (- 1) main_~p~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,618 INFO L272 TraceCheckUtils]: 54: Hoare triple {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~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)); {16401#true} is VALID [2022-04-08 10:46:52,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,619 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16401#true} {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #67#return; {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,619 INFO L272 TraceCheckUtils]: 59: Hoare triple {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~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)); {16401#true} is VALID [2022-04-08 10:46:52,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {16401#true} ~cond := #in~cond; {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:46:52,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,620 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} {16567#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #69#return; {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,620 INFO L272 TraceCheckUtils]: 64: Hoare triple {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~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)); {16401#true} is VALID [2022-04-08 10:46:52,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {16401#true} ~cond := #in~cond; {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:46:52,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {16494#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:46:52,622 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #71#return; {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:46:52,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {16601#(and (= main_~q~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0))) (= (+ (* (- 2) main_~s~0) 1) main_~r~0) (= (+ (* (- 1) main_~s~0) 1) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~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; {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} is VALID [2022-04-08 10:46:52,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} assume !false; {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} is VALID [2022-04-08 10:46:52,626 INFO L272 TraceCheckUtils]: 72: Hoare triple {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:46:52,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:46:52,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:46:52,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:46:52,627 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16401#true} {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} #67#return; {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} is VALID [2022-04-08 10:46:52,631 INFO L272 TraceCheckUtils]: 77: Hoare triple {16623#(and (= (- 1) (+ main_~r~0 1)) (= (+ (* (- 1) main_~y~0 main_~r~0) main_~x~0 (* (- 1) main_~y~0) (* (div main_~p~0 (- 3)) main_~x~0 2)) (+ main_~y~0 (* (- 1) main_~x~0))) (= (+ (* (- 2) (* (div main_~p~0 (- 3)) main_~x~0 2)) (* (- 2) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~y~0 2)) main_~a~0) (= (mod main_~p~0 3) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:46:52,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {16645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:46:52,632 INFO L290 TraceCheckUtils]: 79: Hoare triple {16649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16402#false} is VALID [2022-04-08 10:46:52,632 INFO L290 TraceCheckUtils]: 80: Hoare triple {16402#false} assume !false; {16402#false} is VALID [2022-04-08 10:46:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 59 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-08 10:46:52,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:47:39,955 INFO L290 TraceCheckUtils]: 80: Hoare triple {16402#false} assume !false; {16402#false} is VALID [2022-04-08 10:47:39,956 INFO L290 TraceCheckUtils]: 79: Hoare triple {16649#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16402#false} is VALID [2022-04-08 10:47:39,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {16645#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16649#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:47:39,957 INFO L272 TraceCheckUtils]: 77: Hoare triple {16665#(= 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)); {16645#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:47:39,958 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16401#true} {16665#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {16665#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:47:39,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:39,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:39,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:39,958 INFO L272 TraceCheckUtils]: 72: Hoare triple {16665#(= 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)); {16401#true} is VALID [2022-04-08 10:47:39,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {16665#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {16665#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:47:40,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {16687#(= (+ 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; {16665#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:47:40,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {16687#(= (+ 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); {16687#(= (+ 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-08 10:47:40,252 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} {16694#(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)))))} #71#return; {16687#(= (+ 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-08 10:47:40,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:40,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {16704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:40,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {16401#true} ~cond := #in~cond; {16704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:47:40,253 INFO L272 TraceCheckUtils]: 64: Hoare triple {16694#(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)); {16401#true} is VALID [2022-04-08 10:47:40,254 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} {16401#true} #69#return; {16694#(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-08 10:47:40,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {16704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16498#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {16401#true} ~cond := #in~cond; {16704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:47:40,255 INFO L272 TraceCheckUtils]: 59: Hoare triple {16401#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16401#true} {16401#true} #67#return; {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L272 TraceCheckUtils]: 54: Hoare triple {16401#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {16401#true} assume !false; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {16401#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {16401#true} assume !!(~a~0 != ~b~0); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16401#true} {16401#true} #71#return; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L272 TraceCheckUtils]: 46: Hoare triple {16401#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16401#true} {16401#true} #69#return; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L272 TraceCheckUtils]: 41: Hoare triple {16401#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16401#true} {16401#true} #67#return; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {16401#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {16401#true} assume !false; {16401#true} is VALID [2022-04-08 10:47:40,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {16401#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {16401#true} assume !!(~a~0 != ~b~0); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16401#true} {16401#true} #71#return; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L272 TraceCheckUtils]: 28: Hoare triple {16401#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16401#true} {16401#true} #69#return; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L272 TraceCheckUtils]: 23: Hoare triple {16401#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16401#true} {16401#true} #67#return; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {16401#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {16401#true} assume !false; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {16401#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16401#true} is VALID [2022-04-08 10:47:40,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16401#true} {16401#true} #65#return; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {16401#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16401#true} {16401#true} #63#return; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {16401#true} assume !(0 == ~cond); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {16401#true} ~cond := #in~cond; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {16401#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {16401#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {16401#true} call #t~ret6 := main(); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16401#true} {16401#true} #81#return; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {16401#true} assume true; {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {16401#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16401#true} is VALID [2022-04-08 10:47:40,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {16401#true} call ULTIMATE.init(); {16401#true} is VALID [2022-04-08 10:47:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 10:47:40,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:47:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981938273] [2022-04-08 10:47:40,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:47:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926484967] [2022-04-08 10:47:40,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926484967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:47:40,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:47:40,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 10:47:40,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:47:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438611054] [2022-04-08 10:47:40,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438611054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:47:40,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:47:40,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:47:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971248786] [2022-04-08 10:47:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:47:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2022-04-08 10:47:40,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:47:40,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:47:40,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:47:40,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:47:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:47:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:47:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:47:40,334 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:47:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:47:43,149 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2022-04-08 10:47:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:47:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2022-04-08 10:47:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:47:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:47:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2022-04-08 10:47:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:47:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2022-04-08 10:47:43,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 90 transitions. [2022-04-08 10:47:43,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:47:43,241 INFO L225 Difference]: With dead ends: 261 [2022-04-08 10:47:43,241 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 10:47:43,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:47:43,242 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:47:43,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 214 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:47:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 10:47:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 223. [2022-04-08 10:47:43,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:47:43,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 10:47:43,466 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 10:47:43,467 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 10:47:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:47:43,471 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2022-04-08 10:47:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 311 transitions. [2022-04-08 10:47:43,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:47:43,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:47:43,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) Second operand 259 states. [2022-04-08 10:47:43,472 INFO L87 Difference]: Start difference. First operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) Second operand 259 states. [2022-04-08 10:47:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:47:43,476 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2022-04-08 10:47:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 311 transitions. [2022-04-08 10:47:43,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:47:43,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:47:43,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:47:43,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:47:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 56 states have call successors, (56), 31 states have call predecessors, (56), 30 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 10:47:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2022-04-08 10:47:43,481 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 81 [2022-04-08 10:47:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:47:43,482 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2022-04-08 10:47:43,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 10:47:43,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 264 transitions. [2022-04-08 10:47:44,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:47:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2022-04-08 10:47:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 10:47:44,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:47:44,183 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 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] [2022-04-08 10:47:44,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 10:47:44,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 10:47:44,399 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:47:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:47:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 997428706, now seen corresponding path program 11 times [2022-04-08 10:47:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:47:44,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495190435] [2022-04-08 10:47:44,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:47:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 997428706, now seen corresponding path program 12 times [2022-04-08 10:47:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:47:44,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253571102] [2022-04-08 10:47:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:47:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:47:44,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:47:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205859125] [2022-04-08 10:47:44,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:47:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:47:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:47:44,410 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:47:44,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 10:47:44,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:47:44,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:47:44,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:47:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:47:44,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:47:44,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {18392#true} call ULTIMATE.init(); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {18392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18392#true} {18392#true} #81#return; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {18392#true} call #t~ret6 := main(); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {18392#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {18392#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18392#true} {18392#true} #63#return; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {18392#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18392#true} {18392#true} #65#return; {18392#true} is VALID [2022-04-08 10:47:44,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {18392#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,962 INFO L272 TraceCheckUtils]: 18: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,963 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,963 INFO L272 TraceCheckUtils]: 23: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,963 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,964 INFO L272 TraceCheckUtils]: 28: Hoare triple {18445#(and (= main_~r~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)); {18392#true} is VALID [2022-04-08 10:47:44,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,964 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {18445#(and (= main_~r~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; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,965 INFO L272 TraceCheckUtils]: 36: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,966 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,966 INFO L272 TraceCheckUtils]: 41: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,967 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,967 INFO L272 TraceCheckUtils]: 46: Hoare triple {18445#(and (= main_~r~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)); {18392#true} is VALID [2022-04-08 10:47:44,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,967 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,968 INFO L290 TraceCheckUtils]: 51: Hoare triple {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {18445#(and (= main_~r~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; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,968 INFO L272 TraceCheckUtils]: 54: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,969 INFO L272 TraceCheckUtils]: 59: Hoare triple {18445#(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)); {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {18392#true} ~cond := #in~cond; {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {18392#true} assume !(0 == ~cond); {18392#true} is VALID [2022-04-08 10:47:44,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {18392#true} assume true; {18392#true} is VALID [2022-04-08 10:47:44,970 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18392#true} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,970 INFO L272 TraceCheckUtils]: 64: Hoare triple {18445#(and (= main_~r~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)); {18392#true} is VALID [2022-04-08 10:47:44,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {18392#true} ~cond := #in~cond; {18593#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:47:44,970 INFO L290 TraceCheckUtils]: 66: Hoare triple {18593#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:44,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:44,971 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} {18445#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {18604#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {18604#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {18604#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:47:44,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {18604#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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; {18611#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ main_~x~0 (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* main_~q~0 main_~x~0)))))} is VALID [2022-04-08 10:47:44,973 INFO L290 TraceCheckUtils]: 71: Hoare triple {18611#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ main_~x~0 (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* main_~q~0 main_~x~0)))))} assume !false; {18611#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ main_~x~0 (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* main_~q~0 main_~x~0)))))} is VALID [2022-04-08 10:47:44,973 INFO L272 TraceCheckUtils]: 72: Hoare triple {18611#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ main_~x~0 (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* main_~q~0 main_~x~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18392#true} is VALID [2022-04-08 10:47:44,973 INFO L290 TraceCheckUtils]: 73: Hoare triple {18392#true} ~cond := #in~cond; {18593#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:47:44,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {18593#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:44,974 INFO L290 TraceCheckUtils]: 75: Hoare triple {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:47:44,977 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18597#(not (= |__VERIFIER_assert_#in~cond| 0))} {18611#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ main_~x~0 (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* main_~q~0 main_~x~0)))))} #67#return; {18630#(and (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (+ (* (- 1) main_~p~0) 1) main_~r~0) 1)) (= main_~a~0 (+ (* (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (- 1)) (* (- 1) (* main_~y~0 (* (- 1) main_~r~0))) main_~x~0)))} is VALID [2022-04-08 10:47:44,977 INFO L272 TraceCheckUtils]: 77: Hoare triple {18630#(and (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (+ (* (- 1) main_~p~0) 1) main_~r~0) 1)) (= main_~a~0 (+ (* (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (- 1)) (* (- 1) (* main_~y~0 (* (- 1) main_~r~0))) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:47:44,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {18634#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:47:44,978 INFO L290 TraceCheckUtils]: 79: Hoare triple {18638#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18393#false} is VALID [2022-04-08 10:47:44,978 INFO L290 TraceCheckUtils]: 80: Hoare triple {18393#false} assume !false; {18393#false} is VALID [2022-04-08 10:47:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 70 proven. 11 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-04-08 10:47:44,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:50:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:50:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253571102] [2022-04-08 10:50:17,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:50:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205859125] [2022-04-08 10:50:17,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205859125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:50:17,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:50:17,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 10:50:17,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:50:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495190435] [2022-04-08 10:50:17,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495190435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:50:17,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:50:17,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:50:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230984510] [2022-04-08 10:50:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:50:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2022-04-08 10:50:17,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:50:17,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 10:50:17,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:17,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:50:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:50:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:50:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:50:17,256 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 10:50:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:19,219 INFO L93 Difference]: Finished difference Result 282 states and 346 transitions. [2022-04-08 10:50:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:50:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2022-04-08 10:50:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:50:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 10:50:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 10:50:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 10:50:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 10:50:19,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-08 10:50:19,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:19,349 INFO L225 Difference]: With dead ends: 282 [2022-04-08 10:50:19,349 INFO L226 Difference]: Without dead ends: 276 [2022-04-08 10:50:19,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:50:19,349 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:50:19,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 171 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:50:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-04-08 10:50:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 233. [2022-04-08 10:50:19,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:50:19,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-08 10:50:19,518 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-08 10:50:19,518 INFO L87 Difference]: Start difference. First operand 276 states. Second operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-08 10:50:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:19,522 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2022-04-08 10:50:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 336 transitions. [2022-04-08 10:50:19,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:50:19,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:50:19,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) Second operand 276 states. [2022-04-08 10:50:19,523 INFO L87 Difference]: Start difference. First operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) Second operand 276 states. [2022-04-08 10:50:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:19,542 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2022-04-08 10:50:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 336 transitions. [2022-04-08 10:50:19,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:50:19,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:50:19,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:50:19,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:50:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 142 states have (on average 1.119718309859155) internal successors, (159), 147 states have internal predecessors, (159), 58 states have call successors, (58), 33 states have call predecessors, (58), 32 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-08 10:50:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 273 transitions. [2022-04-08 10:50:19,547 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 273 transitions. Word has length 81 [2022-04-08 10:50:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:50:19,547 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 273 transitions. [2022-04-08 10:50:19,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 10:50:19,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 273 transitions. [2022-04-08 10:50:20,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 273 transitions. [2022-04-08 10:50:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 10:50:20,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:50:20,500 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:50:20,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 10:50:20,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:50:20,700 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:50:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:50:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 327884660, now seen corresponding path program 13 times [2022-04-08 10:50:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:50:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151633154] [2022-04-08 10:50:20,701 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:50:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 327884660, now seen corresponding path program 14 times [2022-04-08 10:50:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:50:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055240843] [2022-04-08 10:50:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:50:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:50:20,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:50:20,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120713543] [2022-04-08 10:50:20,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:50:20,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:50:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:50:20,720 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:50:20,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 10:50:20,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:50:20,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:50:20,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 10:50:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:50:20,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:50:21,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {20330#true} call ULTIMATE.init(); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {20330#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20330#true} {20330#true} #81#return; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {20330#true} call #t~ret6 := main(); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {20330#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {20330#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20330#true} {20330#true} #63#return; {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {20330#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20330#true} {20330#true} #65#return; {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {20330#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20383#(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-08 10:50:21,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {20383#(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; {20383#(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-08 10:50:21,700 INFO L272 TraceCheckUtils]: 18: Hoare triple {20383#(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)); {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,701 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20330#true} {20383#(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))} #67#return; {20383#(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-08 10:50:21,701 INFO L272 TraceCheckUtils]: 23: Hoare triple {20383#(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)); {20330#true} is VALID [2022-04-08 10:50:21,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,702 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20330#true} {20383#(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))} #69#return; {20383#(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-08 10:50:21,702 INFO L272 TraceCheckUtils]: 28: Hoare triple {20383#(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)); {20330#true} is VALID [2022-04-08 10:50:21,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,703 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20330#true} {20383#(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))} #71#return; {20383#(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-08 10:50:21,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {20383#(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); {20383#(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-08 10:50:21,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {20383#(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; {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,704 INFO L272 TraceCheckUtils]: 36: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= 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)); {20330#true} is VALID [2022-04-08 10:50:21,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,705 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20330#true} {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #67#return; {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,705 INFO L272 TraceCheckUtils]: 41: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= 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)); {20330#true} is VALID [2022-04-08 10:50:21,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,706 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20330#true} {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #69#return; {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,706 INFO L272 TraceCheckUtils]: 46: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~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)); {20330#true} is VALID [2022-04-08 10:50:21,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,706 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20330#true} {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #71#return; {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {20438#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= 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; {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} assume !false; {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,708 INFO L272 TraceCheckUtils]: 54: Hoare triple {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,709 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20330#true} {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #67#return; {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,709 INFO L272 TraceCheckUtils]: 59: Hoare triple {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,710 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20330#true} {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #69#return; {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,710 INFO L272 TraceCheckUtils]: 64: Hoare triple {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,711 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20330#true} {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #71#return; {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:50:21,711 INFO L290 TraceCheckUtils]: 69: Hoare triple {20493#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {20545#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:50:21,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {20545#(and (= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0) (not (= main_~b~0 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; {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} is VALID [2022-04-08 10:50:21,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} assume !false; {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} is VALID [2022-04-08 10:50:21,713 INFO L272 TraceCheckUtils]: 72: Hoare triple {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,713 INFO L290 TraceCheckUtils]: 73: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,714 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20330#true} {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} #67#return; {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} is VALID [2022-04-08 10:50:21,714 INFO L272 TraceCheckUtils]: 77: Hoare triple {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:21,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:21,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:21,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:21,715 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20330#true} {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} #69#return; {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} is VALID [2022-04-08 10:50:21,715 INFO L272 TraceCheckUtils]: 82: Hoare triple {20549#(and (= (+ 3 (* (- 1) main_~s~0)) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) (+ (* (- 1) main_~b~0) (* main_~y~0 2))) (< main_~b~0 main_~y~0) (not (< main_~b~0 0)) (= (* (- 1) main_~q~0) 1) (not (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:50:21,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {20586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:50:21,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {20590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20331#false} is VALID [2022-04-08 10:50:21,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {20331#false} assume !false; {20331#false} is VALID [2022-04-08 10:50:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 10:50:21,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:50:22,441 INFO L290 TraceCheckUtils]: 85: Hoare triple {20331#false} assume !false; {20331#false} is VALID [2022-04-08 10:50:22,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {20590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20331#false} is VALID [2022-04-08 10:50:22,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {20586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:50:22,442 INFO L272 TraceCheckUtils]: 82: Hoare triple {20606#(= 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)); {20586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:50:22,443 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20330#true} {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:50:22,443 INFO L290 TraceCheckUtils]: 80: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,443 INFO L272 TraceCheckUtils]: 77: Hoare triple {20606#(= 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)); {20330#true} is VALID [2022-04-08 10:50:22,444 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {20330#true} {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:50:22,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,444 INFO L272 TraceCheckUtils]: 72: Hoare triple {20606#(= 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)); {20330#true} is VALID [2022-04-08 10:50:22,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:50:22,575 INFO L290 TraceCheckUtils]: 70: Hoare triple {20643#(or (< main_~b~0 main_~a~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 !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {20606#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:50:22,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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 !!(~a~0 != ~b~0); {20643#(or (< main_~b~0 main_~a~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-08 10:50:22,577 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20330#true} {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)))} #71#return; {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:50:22,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,577 INFO L272 TraceCheckUtils]: 64: Hoare triple {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {20330#true} is VALID [2022-04-08 10:50:22,577 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20330#true} {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)))} #69#return; {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:50:22,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L272 TraceCheckUtils]: 59: Hoare triple {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20330#true} {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)))} #67#return; {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:50:22,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L290 TraceCheckUtils]: 56: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,578 INFO L272 TraceCheckUtils]: 54: Hoare triple {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {20330#true} is VALID [2022-04-08 10:50:22,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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; {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:50:22,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20647#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:50:22,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} assume !!(~a~0 != ~b~0); {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is VALID [2022-04-08 10:50:22,699 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20330#true} {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} #71#return; {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is VALID [2022-04-08 10:50:22,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,699 INFO L272 TraceCheckUtils]: 46: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:22,700 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20330#true} {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} #69#return; {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is VALID [2022-04-08 10:50:22,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,700 INFO L272 TraceCheckUtils]: 41: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:22,701 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20330#true} {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} #67#return; {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is VALID [2022-04-08 10:50:22,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:22,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:22,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:22,701 INFO L272 TraceCheckUtils]: 36: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:22,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} assume !false; {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is VALID [2022-04-08 10:50:24,704 WARN L290 TraceCheckUtils]: 34: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) 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; {20699#(or (= (+ (* (+ (* main_~q~0 2) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 2) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 2))) (< (* main_~b~0 2) main_~a~0) (not (< main_~b~0 main_~a~0)) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~b~0))} is UNKNOWN [2022-04-08 10:50:24,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} assume !!(~a~0 != ~b~0); {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,705 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20330#true} {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} #71#return; {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L272 TraceCheckUtils]: 28: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20330#true} {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} #69#return; {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:24,706 INFO L272 TraceCheckUtils]: 23: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:24,707 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20330#true} {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} #67#return; {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:24,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:24,707 INFO L272 TraceCheckUtils]: 18: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:24,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} assume !false; {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {20330#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20754#(or (< (* main_~b~0 3) main_~a~0) (= (+ (* (+ (* main_~q~0 3) (* (- 1) main_~p~0)) main_~x~0) (* main_~y~0 (+ (* main_~s~0 3) (* (- 1) main_~r~0)))) (+ (* (- 1) main_~a~0) (* main_~b~0 3))) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~b~0) (not (< (* main_~b~0 2) main_~a~0)))} is VALID [2022-04-08 10:50:24,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20330#true} {20330#true} #65#return; {20330#true} is VALID [2022-04-08 10:50:24,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:24,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L272 TraceCheckUtils]: 11: Hoare triple {20330#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20330#true} {20330#true} #63#return; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {20330#true} assume !(0 == ~cond); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {20330#true} ~cond := #in~cond; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {20330#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {20330#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {20330#true} call #t~ret6 := main(); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20330#true} {20330#true} #81#return; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {20330#true} assume true; {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {20330#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {20330#true} call ULTIMATE.init(); {20330#true} is VALID [2022-04-08 10:50:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 10:50:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:50:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055240843] [2022-04-08 10:50:24,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:50:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120713543] [2022-04-08 10:50:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120713543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:50:24,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:50:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 10:50:24,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:50:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151633154] [2022-04-08 10:50:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151633154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:50:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:50:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:50:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333551132] [2022-04-08 10:50:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:50:24,711 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), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-08 10:50:24,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:50:24,711 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), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:50:24,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:24,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:50:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:50:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:50:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:50:24,761 INFO L87 Difference]: Start difference. First operand 233 states and 273 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:50:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:27,430 INFO L93 Difference]: Finished difference Result 255 states and 307 transitions. [2022-04-08 10:50:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:50:27,430 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), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-08 10:50:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:50:27,430 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), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:50:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2022-04-08 10:50:27,450 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), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:50:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2022-04-08 10:50:27,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 90 transitions. [2022-04-08 10:50:27,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:27,580 INFO L225 Difference]: With dead ends: 255 [2022-04-08 10:50:27,580 INFO L226 Difference]: Without dead ends: 249 [2022-04-08 10:50:27,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:50:27,580 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:50:27,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:50:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-08 10:50:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2022-04-08 10:50:27,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:50:27,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-08 10:50:27,887 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-08 10:50:27,888 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-08 10:50:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:27,896 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-04-08 10:50:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2022-04-08 10:50:27,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:50:27,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:50:27,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 249 states. [2022-04-08 10:50:27,897 INFO L87 Difference]: Start difference. First operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 249 states. [2022-04-08 10:50:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:50:27,915 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-04-08 10:50:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2022-04-08 10:50:27,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:50:27,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:50:27,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:50:27,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:50:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 143 states have (on average 1.118881118881119) internal successors, (160), 149 states have internal predecessors, (160), 60 states have call successors, (60), 33 states have call predecessors, (60), 32 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-08 10:50:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 278 transitions. [2022-04-08 10:50:27,921 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 278 transitions. Word has length 86 [2022-04-08 10:50:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:50:27,921 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 278 transitions. [2022-04-08 10:50:27,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:50:27,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 236 states and 278 transitions. [2022-04-08 10:50:28,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:50:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 278 transitions. [2022-04-08 10:50:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 10:50:28,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:50:28,921 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:50:28,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 10:50:29,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:50:29,121 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:50:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:50:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1916098638, now seen corresponding path program 15 times [2022-04-08 10:50:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:50:29,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754147826] [2022-04-08 10:50:29,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:50:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1916098638, now seen corresponding path program 16 times [2022-04-08 10:50:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:50:29,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337783298] [2022-04-08 10:50:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:50:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:50:29,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:50:29,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479782668] [2022-04-08 10:50:29,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:50:29,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:50:29,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:50:29,135 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:50:29,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 10:50:29,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:50:29,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:50:29,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-08 10:50:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:50:29,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:51:38,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {22341#true} call ULTIMATE.init(); {22341#true} is VALID [2022-04-08 10:51:38,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {22341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22341#true} is VALID [2022-04-08 10:51:38,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#true} {22341#true} #81#return; {22341#true} is VALID [2022-04-08 10:51:38,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#true} call #t~ret6 := main(); {22341#true} is VALID [2022-04-08 10:51:38,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22341#true} is VALID [2022-04-08 10:51:38,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22341#true} {22341#true} #63#return; {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22341#true} {22341#true} #65#return; {22341#true} is VALID [2022-04-08 10:51:38,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,868 INFO L272 TraceCheckUtils]: 18: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= 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)); {22341#true} is VALID [2022-04-08 10:51:38,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,869 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22341#true} {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #67#return; {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,869 INFO L272 TraceCheckUtils]: 23: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= 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)); {22341#true} is VALID [2022-04-08 10:51:38,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,870 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22341#true} {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #69#return; {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,870 INFO L272 TraceCheckUtils]: 28: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= 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)); {22341#true} is VALID [2022-04-08 10:51:38,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,871 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22341#true} {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #71#return; {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 10:51:38,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {22394#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= 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; {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !false; {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,873 INFO L272 TraceCheckUtils]: 36: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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)); {22341#true} is VALID [2022-04-08 10:51:38,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,873 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22341#true} {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #67#return; {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,874 INFO L272 TraceCheckUtils]: 41: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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)); {22341#true} is VALID [2022-04-08 10:51:38,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,874 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22341#true} {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #69#return; {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,874 INFO L272 TraceCheckUtils]: 46: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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)); {22341#true} is VALID [2022-04-08 10:51:38,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {22341#true} ~cond := #in~cond; {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:38,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,876 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} #71#return; {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} assume !!(~a~0 != ~b~0); {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 10:51:38,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {22449#(and (< main_~b~0 main_~x~0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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; {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,878 INFO L272 TraceCheckUtils]: 54: Hoare triple {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,879 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22341#true} {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} #67#return; {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,879 INFO L272 TraceCheckUtils]: 59: Hoare triple {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,880 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22341#true} {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} #69#return; {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,880 INFO L272 TraceCheckUtils]: 64: Hoare triple {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {22341#true} ~cond := #in~cond; {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:38,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,882 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} {22506#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} #71#return; {22555#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {22555#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~q~0 main_~p~0) 0))} assume !!(~a~0 != ~b~0); {22559#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (not (= main_~b~0 main_~a~0)) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-08 10:51:38,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {22559#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (< main_~y~0 main_~x~0) (<= 1 (+ (* main_~p~0 2) main_~q~0)) (= (- 1) main_~r~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (not (= main_~b~0 main_~a~0)) (= (+ main_~q~0 main_~p~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; {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 10:51:38,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !false; {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 10:51:38,886 INFO L272 TraceCheckUtils]: 72: Hoare triple {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:51:38,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:51:38,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:51:38,887 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {22341#true} {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} #67#return; {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 10:51:38,887 INFO L272 TraceCheckUtils]: 77: Hoare triple {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:51:38,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {22341#true} ~cond := #in~cond; {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:38,887 INFO L290 TraceCheckUtils]: 79: Hoare triple {22489#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:38,891 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} {22563#(and (= (+ main_~b~0 main_~a~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~y~0 main_~s~0))) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ (* main_~a~0 2) main_~b~0) main_~y~0) (= (+ main_~s~0 (* main_~r~0 2)) 1) (= (+ main_~r~0 1) 0) (< main_~y~0 main_~x~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} #69#return; {22597#(and (= (* 2 (* main_~y~0 main_~s~0)) (+ main_~b~0 (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) 2))) (* main_~y~0 3))) (< main_~y~0 main_~x~0) (= (+ main_~b~0 main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) 2))) (* main_~y~0 main_~s~0)) (not (= main_~b~0 0)) (= (mod main_~q~0 2) 0) (<= 0 main_~b~0) (= (* main_~y~0 main_~s~0) (+ main_~b~0 (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) 2))))))} is VALID [2022-04-08 10:51:38,894 INFO L272 TraceCheckUtils]: 82: Hoare triple {22597#(and (= (* 2 (* main_~y~0 main_~s~0)) (+ main_~b~0 (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) 2))) (* main_~y~0 3))) (< main_~y~0 main_~x~0) (= (+ main_~b~0 main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) 2))) (* main_~y~0 main_~s~0)) (not (= main_~b~0 0)) (= (mod main_~q~0 2) 0) (<= 0 main_~b~0) (= (* main_~y~0 main_~s~0) (+ main_~b~0 (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) 2))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:51:38,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {22601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:38,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {22605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22342#false} is VALID [2022-04-08 10:51:38,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {22342#false} assume !false; {22342#false} is VALID [2022-04-08 10:51:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 79 proven. 45 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-04-08 10:51:38,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:52:32,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {22342#false} assume !false; {22342#false} is VALID [2022-04-08 10:52:32,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {22605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22342#false} is VALID [2022-04-08 10:52:32,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {22601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:32,304 INFO L272 TraceCheckUtils]: 82: Hoare triple {22621#(= 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)); {22601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:52:32,305 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #69#return; {22621#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:52:32,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:32,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {22635#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:32,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {22341#true} ~cond := #in~cond; {22635#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:52:32,306 INFO L272 TraceCheckUtils]: 77: Hoare triple {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {22341#true} is VALID [2022-04-08 10:52:32,306 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {22341#true} {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #67#return; {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:52:32,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,306 INFO L272 TraceCheckUtils]: 72: Hoare triple {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {22341#true} is VALID [2022-04-08 10:52:32,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:52:32,692 INFO L290 TraceCheckUtils]: 70: Hoare triple {22660#(or (< main_~b~0 main_~a~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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 !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {22625#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:52:32,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {22664#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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 !!(~a~0 != ~b~0); {22660#(or (< main_~b~0 main_~a~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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-08 10:52:32,695 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} {22341#true} #71#return; {22664#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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-08 10:52:32,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {22635#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {22341#true} ~cond := #in~cond; {22635#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:52:32,696 INFO L272 TraceCheckUtils]: 64: Hoare triple {22341#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22341#true} {22341#true} #69#return; {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L272 TraceCheckUtils]: 59: Hoare triple {22341#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22341#true} {22341#true} #67#return; {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L272 TraceCheckUtils]: 54: Hoare triple {22341#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {22341#true} assume !false; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {22341#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {22341#true} assume !!(~a~0 != ~b~0); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22341#true} {22341#true} #71#return; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L272 TraceCheckUtils]: 46: Hoare triple {22341#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22341#true} {22341#true} #69#return; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L272 TraceCheckUtils]: 41: Hoare triple {22341#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22341#true} {22341#true} #67#return; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,697 INFO L272 TraceCheckUtils]: 36: Hoare triple {22341#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {22341#true} assume !false; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {22341#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {22341#true} assume !!(~a~0 != ~b~0); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22341#true} {22341#true} #71#return; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L272 TraceCheckUtils]: 28: Hoare triple {22341#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22341#true} {22341#true} #69#return; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L272 TraceCheckUtils]: 23: Hoare triple {22341#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22341#true} {22341#true} #67#return; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L272 TraceCheckUtils]: 18: Hoare triple {22341#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {22341#true} assume !false; {22341#true} is VALID [2022-04-08 10:52:32,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22341#true} {22341#true} #65#return; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22341#true} {22341#true} #63#return; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {22341#true} assume !(0 == ~cond); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {22341#true} ~cond := #in~cond; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#true} call #t~ret6 := main(); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#true} {22341#true} #81#return; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#true} assume true; {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {22341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22341#true} is VALID [2022-04-08 10:52:32,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {22341#true} call ULTIMATE.init(); {22341#true} is VALID [2022-04-08 10:52:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 87 proven. 5 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 10:52:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:52:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337783298] [2022-04-08 10:52:32,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:52:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479782668] [2022-04-08 10:52:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479782668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:52:32,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:52:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 10:52:32,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:52:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [754147826] [2022-04-08 10:52:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [754147826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:52:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257188491] [2022-04-08 10:52:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:52:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-08 10:52:32,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:52:32,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:52:32,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:32,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:52:32,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:52:32,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:52:32,778 INFO L87 Difference]: Start difference. First operand 236 states and 278 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:52:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:39,863 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2022-04-08 10:52:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:52:39,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-08 10:52:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:52:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:52:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-08 10:52:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:52:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-08 10:52:39,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2022-04-08 10:52:40,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:40,136 INFO L225 Difference]: With dead ends: 282 [2022-04-08 10:52:40,136 INFO L226 Difference]: Without dead ends: 272 [2022-04-08 10:52:40,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:52:40,138 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:52:40,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 203 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 10:52:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-08 10:52:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2022-04-08 10:52:40,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:52:40,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-08 10:52:40,465 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-08 10:52:40,465 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-08 10:52:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:40,478 INFO L93 Difference]: Finished difference Result 272 states and 320 transitions. [2022-04-08 10:52:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 320 transitions. [2022-04-08 10:52:40,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:40,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:40,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) Second operand 272 states. [2022-04-08 10:52:40,479 INFO L87 Difference]: Start difference. First operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) Second operand 272 states. [2022-04-08 10:52:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:40,499 INFO L93 Difference]: Finished difference Result 272 states and 320 transitions. [2022-04-08 10:52:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 320 transitions. [2022-04-08 10:52:40,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:40,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:40,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:52:40,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:52:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 155 states have (on average 1.1161290322580646) internal successors, (173), 161 states have internal predecessors, (173), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (61), 56 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-08 10:52:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 297 transitions. [2022-04-08 10:52:40,505 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 297 transitions. Word has length 86 [2022-04-08 10:52:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:52:40,505 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 297 transitions. [2022-04-08 10:52:40,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 10:52:40,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 297 transitions. [2022-04-08 10:52:41,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 297 transitions. [2022-04-08 10:52:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 10:52:41,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:52:41,782 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:52:41,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 10:52:41,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:52:41,983 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:52:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:52:41,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1866224690, now seen corresponding path program 17 times [2022-04-08 10:52:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:41,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804828921] [2022-04-08 10:52:41,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:52:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1866224690, now seen corresponding path program 18 times [2022-04-08 10:52:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:52:41,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793903936] [2022-04-08 10:52:41,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:52:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:52:41,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:52:41,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238667753] [2022-04-08 10:52:41,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:52:41,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:52:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:52:41,998 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:52:41,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 10:52:42,045 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:52:42,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:52:42,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:52:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:42,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:53:21,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {24494#true} call ULTIMATE.init(); {24494#true} is VALID [2022-04-08 10:53:21,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {24494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {24494#true} is VALID [2022-04-08 10:53:21,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24494#true} {24494#true} #81#return; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {24494#true} call #t~ret6 := main(); {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {24494#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {24494#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24494#true} {24494#true} #63#return; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {24494#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24494#true} {24494#true} #65#return; {24494#true} is VALID [2022-04-08 10:53:21,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {24494#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,895 INFO L272 TraceCheckUtils]: 18: Hoare triple {24547#(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)); {24494#true} is VALID [2022-04-08 10:53:21,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,896 INFO L272 TraceCheckUtils]: 23: Hoare triple {24547#(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)); {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,896 INFO L272 TraceCheckUtils]: 28: Hoare triple {24547#(and (= main_~r~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)); {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {24547#(and (= main_~r~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; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,898 INFO L272 TraceCheckUtils]: 36: Hoare triple {24547#(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)); {24494#true} is VALID [2022-04-08 10:53:21,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,899 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,899 INFO L272 TraceCheckUtils]: 41: Hoare triple {24547#(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)); {24494#true} is VALID [2022-04-08 10:53:21,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,899 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {24547#(and (= main_~r~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)); {24494#true} is VALID [2022-04-08 10:53:21,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,900 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24494#true} {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {24547#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 10:53:21,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {24547#(and (= main_~r~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; {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,902 INFO L272 TraceCheckUtils]: 54: Hoare triple {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~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)); {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24494#true} {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #67#return; {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,902 INFO L272 TraceCheckUtils]: 59: Hoare triple {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~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)); {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,903 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24494#true} {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #69#return; {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,903 INFO L272 TraceCheckUtils]: 64: Hoare triple {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~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)); {24494#true} is VALID [2022-04-08 10:53:21,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {24494#true} ~cond := #in~cond; {24696#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:21,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {24696#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:21,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:21,905 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} {24656#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #71#return; {24707#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {24707#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {24707#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:53:21,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {24707#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~q~0 main_~p~0) 1) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~x~0 (+ main_~b~0 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; {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} is VALID [2022-04-08 10:53:21,954 INFO L290 TraceCheckUtils]: 71: Hoare triple {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} assume !false; {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} is VALID [2022-04-08 10:53:21,955 INFO L272 TraceCheckUtils]: 72: Hoare triple {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:21,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:21,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:21,955 INFO L290 TraceCheckUtils]: 75: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:21,955 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {24494#true} {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} #67#return; {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} is VALID [2022-04-08 10:53:21,955 INFO L272 TraceCheckUtils]: 77: Hoare triple {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:21,956 INFO L290 TraceCheckUtils]: 78: Hoare triple {24494#true} ~cond := #in~cond; {24696#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:21,956 INFO L290 TraceCheckUtils]: 79: Hoare triple {24696#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:21,956 INFO L290 TraceCheckUtils]: 80: Hoare triple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:23,960 WARN L284 TraceCheckUtils]: 81: Hoare quadruple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} {24714#(and (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* (+ main_~s~0 main_~r~0) main_~y~0)) (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= main_~r~0 (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))))} #69#return; {24748#(and (= (+ main_~b~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) 2) main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* 2 (* (div (* (- 1) main_~s~0) 2) main_~y~0)))) (= (mod main_~s~0 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} is UNKNOWN [2022-04-08 10:53:25,266 INFO L272 TraceCheckUtils]: 82: Hoare triple {24748#(and (= (+ main_~b~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) 2) main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* 2 (* (div (* (- 1) main_~s~0) 2) main_~y~0)))) (= (mod main_~s~0 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:53:25,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {24752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:25,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {24756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24495#false} is VALID [2022-04-08 10:53:25,276 INFO L290 TraceCheckUtils]: 85: Hoare triple {24495#false} assume !false; {24495#false} is VALID [2022-04-08 10:53:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 71 proven. 29 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-04-08 10:53:25,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:53:57,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {24495#false} assume !false; {24495#false} is VALID [2022-04-08 10:53:57,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {24756#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24495#false} is VALID [2022-04-08 10:53:57,719 INFO L290 TraceCheckUtils]: 83: Hoare triple {24752#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24756#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:57,720 INFO L272 TraceCheckUtils]: 82: Hoare triple {24772#(= 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)); {24752#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:53:57,721 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #69#return; {24772#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 10:53:57,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:57,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {24786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:57,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {24494#true} ~cond := #in~cond; {24786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:53:57,722 INFO L272 TraceCheckUtils]: 77: Hoare triple {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {24494#true} is VALID [2022-04-08 10:53:57,722 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {24494#true} {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #67#return; {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:53:57,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,723 INFO L290 TraceCheckUtils]: 74: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,723 INFO L272 TraceCheckUtils]: 72: Hoare triple {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {24494#true} is VALID [2022-04-08 10:53:57,723 INFO L290 TraceCheckUtils]: 71: Hoare triple {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:53:57,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:53:57,914 INFO L290 TraceCheckUtils]: 69: Hoare triple {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~a~0 != ~b~0); {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:53:57,915 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} {24494#true} #71#return; {24776#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 10:53:57,915 INFO L290 TraceCheckUtils]: 67: Hoare triple {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {24786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {24700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 65: Hoare triple {24494#true} ~cond := #in~cond; {24786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:53:57,916 INFO L272 TraceCheckUtils]: 64: Hoare triple {24494#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24494#true} {24494#true} #69#return; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 60: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L272 TraceCheckUtils]: 59: Hoare triple {24494#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24494#true} {24494#true} #67#return; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 57: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,916 INFO L272 TraceCheckUtils]: 54: Hoare triple {24494#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {24494#true} assume !false; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {24494#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {24494#true} assume !!(~a~0 != ~b~0); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24494#true} {24494#true} #71#return; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L272 TraceCheckUtils]: 46: Hoare triple {24494#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24494#true} {24494#true} #69#return; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L272 TraceCheckUtils]: 41: Hoare triple {24494#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24494#true} {24494#true} #67#return; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L272 TraceCheckUtils]: 36: Hoare triple {24494#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {24494#true} assume !false; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {24494#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {24494#true} assume !!(~a~0 != ~b~0); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24494#true} {24494#true} #71#return; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L272 TraceCheckUtils]: 28: Hoare triple {24494#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24494#true} {24494#true} #69#return; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L272 TraceCheckUtils]: 23: Hoare triple {24494#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24494#true} {24494#true} #67#return; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L272 TraceCheckUtils]: 18: Hoare triple {24494#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {24494#true} assume !false; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {24494#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24494#true} is VALID [2022-04-08 10:53:57,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24494#true} {24494#true} #65#return; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {24494#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24494#true} {24494#true} #63#return; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {24494#true} assume !(0 == ~cond); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {24494#true} ~cond := #in~cond; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {24494#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {24494#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {24494#true} call #t~ret6 := main(); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24494#true} {24494#true} #81#return; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {24494#true} assume true; {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {24494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {24494#true} is VALID [2022-04-08 10:53:57,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {24494#true} call ULTIMATE.init(); {24494#true} is VALID [2022-04-08 10:53:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 87 proven. 5 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 10:53:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:53:57,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793903936] [2022-04-08 10:53:57,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:53:57,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238667753] [2022-04-08 10:53:57,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238667753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:53:57,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:53:57,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-04-08 10:53:57,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:53:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804828921] [2022-04-08 10:53:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804828921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:57,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:53:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877207540] [2022-04-08 10:53:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:53:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2022-04-08 10:53:57,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:53:57,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:54:02,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 46 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:54:02,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:54:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:54:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:54:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=143, Unknown=3, NotChecked=0, Total=182 [2022-04-08 10:54:02,397 INFO L87 Difference]: Start difference. First operand 254 states and 297 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:54:05,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:07,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:09,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:21,832 WARN L232 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 51 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 10:54:27,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:32,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:34,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:54:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:35,571 INFO L93 Difference]: Finished difference Result 305 states and 372 transitions. [2022-04-08 10:54:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:54:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2022-04-08 10:54:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:54:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:54:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-04-08 10:54:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:54:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-04-08 10:54:35,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-04-08 10:54:38,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:54:38,861 INFO L225 Difference]: With dead ends: 305 [2022-04-08 10:54:38,861 INFO L226 Difference]: Without dead ends: 291 [2022-04-08 10:54:38,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=55, Invalid=214, Unknown=3, NotChecked=0, Total=272 [2022-04-08 10:54:38,868 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:54:38,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 169 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 6 Unknown, 0 Unchecked, 15.6s Time] [2022-04-08 10:54:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-08 10:54:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2022-04-08 10:54:39,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:54:39,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 10:54:39,246 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 10:54:39,246 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 10:54:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:39,250 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2022-04-08 10:54:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 351 transitions. [2022-04-08 10:54:39,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:39,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:39,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) Second operand 291 states. [2022-04-08 10:54:39,252 INFO L87 Difference]: Start difference. First operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) Second operand 291 states. [2022-04-08 10:54:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:39,256 INFO L93 Difference]: Finished difference Result 291 states and 351 transitions. [2022-04-08 10:54:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 351 transitions. [2022-04-08 10:54:39,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:39,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:39,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:54:39,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:54:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 176 states have (on average 1.1363636363636365) internal successors, (200), 180 states have internal predecessors, (200), 73 states have call successors, (73), 38 states have call predecessors, (73), 37 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-08 10:54:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 344 transitions. [2022-04-08 10:54:39,262 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 344 transitions. Word has length 86 [2022-04-08 10:54:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:54:39,279 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 344 transitions. [2022-04-08 10:54:39,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 10:54:39,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 344 transitions. [2022-04-08 10:54:43,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 343 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:54:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 344 transitions. [2022-04-08 10:54:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 10:54:43,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:54:43,538 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:54:43,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 10:54:43,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 10:54:43,738 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:54:43,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:54:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 396850335, now seen corresponding path program 9 times [2022-04-08 10:54:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:54:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187570890] [2022-04-08 10:54:43,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:54:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash 396850335, now seen corresponding path program 10 times [2022-04-08 10:54:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:54:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206146737] [2022-04-08 10:54:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:54:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:54:43,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:54:43,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986116033] [2022-04-08 10:54:43,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:54:43,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:54:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:54:43,768 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:54:43,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 10:54:43,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:54:43,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:54:43,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 10:54:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:54:43,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:54:46,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {26795#true} call ULTIMATE.init(); {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {26795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26795#true} {26795#true} #81#return; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {26795#true} call #t~ret6 := main(); {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {26795#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {26795#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26795#true} {26795#true} #63#return; {26795#true} is VALID [2022-04-08 10:54:46,784 INFO L272 TraceCheckUtils]: 11: Hoare triple {26795#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,785 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26795#true} {26795#true} #65#return; {26795#true} is VALID [2022-04-08 10:54:46,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {26795#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,785 INFO L272 TraceCheckUtils]: 18: Hoare triple {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= 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)); {26795#true} is VALID [2022-04-08 10:54:46,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26795#true} {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,786 INFO L272 TraceCheckUtils]: 23: Hoare triple {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= 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)); {26795#true} is VALID [2022-04-08 10:54:46,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {26795#true} ~cond := #in~cond; {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:46,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,788 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {26848#(and (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26795#true} {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} #71#return; {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {26884#(and (= main_~r~0 0) (= 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) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {26884#(and (= main_~r~0 0) (= 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) (= 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; {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} assume !false; {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,792 INFO L272 TraceCheckUtils]: 36: Hoare triple {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {26795#true} is VALID [2022-04-08 10:54:46,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,792 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26795#true} {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #67#return; {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,793 INFO L272 TraceCheckUtils]: 41: Hoare triple {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {26795#true} is VALID [2022-04-08 10:54:46,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {26795#true} ~cond := #in~cond; {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:46,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,794 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {26906#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #69#return; {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,794 INFO L272 TraceCheckUtils]: 46: Hoare triple {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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)); {26795#true} is VALID [2022-04-08 10:54:46,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,795 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26795#true} {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} #71#return; {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:54:46,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {26940#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~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) (= (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~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; {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !false; {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,800 INFO L272 TraceCheckUtils]: 54: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~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)); {26795#true} is VALID [2022-04-08 10:54:46,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,801 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26795#true} {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #67#return; {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,801 INFO L272 TraceCheckUtils]: 59: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {26795#true} ~cond := #in~cond; {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:46,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,802 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #69#return; {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,802 INFO L272 TraceCheckUtils]: 64: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,803 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26795#true} {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} #71#return; {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} assume !!(~a~0 != ~b~0); {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) main_~q~0) 1)))} is VALID [2022-04-08 10:54:46,804 INFO L290 TraceCheckUtils]: 70: Hoare triple {26962#(and (= (* (- 2) main_~s~0) main_~r~0) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 (+ (* (- 2) 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; {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,805 INFO L272 TraceCheckUtils]: 72: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= 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)); {26795#true} is VALID [2022-04-08 10:54:46,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,806 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {26795#true} {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #67#return; {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,806 INFO L272 TraceCheckUtils]: 77: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= 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)); {26795#true} is VALID [2022-04-08 10:54:46,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {26795#true} ~cond := #in~cond; {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:46,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {26873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:54:46,807 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #69#return; {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,807 INFO L272 TraceCheckUtils]: 82: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= 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)); {26795#true} is VALID [2022-04-08 10:54:46,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,808 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26795#true} {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #71#return; {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 10:54:46,813 INFO L290 TraceCheckUtils]: 88: Hoare triple {27017#(and (= (+ main_~q~0 main_~p~0) (+ (* (- 2) main_~q~0) 1)) (= (+ (* main_~y~0 (* (- 1) main_~s~0)) (* main_~x~0 (+ (* (- 1) main_~q~0) 1))) (+ main_~x~0 (* (- 1) main_~b~0))) (= (+ (* main_~b~0 (- 3)) main_~x~0) main_~a~0) (= main_~r~0 (* main_~s~0 (- 3))) (= 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; {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} assume !false; {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,814 INFO L272 TraceCheckUtils]: 90: Hoare triple {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:54:46,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:54:46,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:54:46,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:54:46,814 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {26795#true} {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} #67#return; {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} is VALID [2022-04-08 10:54:46,818 INFO L272 TraceCheckUtils]: 95: Hoare triple {27072#(and (= (+ main_~x~0 (* (* (div (- main_~r~0) 4) main_~y~0) (- 3))) (+ (* (div (- main_~r~0) 4) main_~y~0) main_~a~0)) (= (* (div (- main_~r~0) 4) main_~y~0) main_~y~0) (= (mod (* main_~r~0 3) 4) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27094#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:54:46,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {27094#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27098#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:46,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {27098#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26796#false} is VALID [2022-04-08 10:54:46,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {26796#false} assume !false; {26796#false} is VALID [2022-04-08 10:54:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 70 proven. 112 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-04-08 10:54:46,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:44,791 INFO L290 TraceCheckUtils]: 98: Hoare triple {26796#false} assume !false; {26796#false} is VALID [2022-04-08 10:55:44,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {27098#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26796#false} is VALID [2022-04-08 10:55:44,792 INFO L290 TraceCheckUtils]: 96: Hoare triple {27094#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27098#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:44,792 INFO L272 TraceCheckUtils]: 95: Hoare triple {27114#(= 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)); {27094#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:44,793 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {26795#true} {27114#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {27114#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:44,793 INFO L290 TraceCheckUtils]: 93: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:44,793 INFO L290 TraceCheckUtils]: 92: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:44,793 INFO L290 TraceCheckUtils]: 91: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:44,793 INFO L272 TraceCheckUtils]: 90: Hoare triple {27114#(= 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)); {26795#true} is VALID [2022-04-08 10:55:44,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {27114#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {27114#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:45,267 INFO L290 TraceCheckUtils]: 88: Hoare triple {27136#(= (+ 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; {27114#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:45,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {27136#(= (+ 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); {27136#(= (+ 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-08 10:55:45,269 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26795#true} {27136#(= (+ 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)))))} #71#return; {27136#(= (+ 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-08 10:55:45,269 INFO L290 TraceCheckUtils]: 85: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,269 INFO L290 TraceCheckUtils]: 83: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,269 INFO L272 TraceCheckUtils]: 82: Hoare triple {27136#(= (+ 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)); {26795#true} is VALID [2022-04-08 10:55:45,270 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {27158#(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)))))} #69#return; {27136#(= (+ 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-08 10:55:45,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:55:45,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {27168#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:55:45,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {26795#true} ~cond := #in~cond; {27168#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:55:45,271 INFO L272 TraceCheckUtils]: 77: Hoare triple {27158#(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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,271 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {26795#true} {27158#(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)))))} #67#return; {27158#(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)))))} is VALID [2022-04-08 10:55:45,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,272 INFO L272 TraceCheckUtils]: 72: Hoare triple {27158#(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)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {27158#(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)))))} assume !false; {27158#(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)))))} is VALID [2022-04-08 10:55:45,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {27193#(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 (= (+ 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; {27158#(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)))))} is VALID [2022-04-08 10:55:45,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {27193#(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 (= (+ 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); {27193#(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 (= (+ 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-08 10:55:45,618 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26795#true} {27193#(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 (= (+ 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)))))))} #71#return; {27193#(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 (= (+ 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-08 10:55:45,618 INFO L290 TraceCheckUtils]: 67: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,619 INFO L272 TraceCheckUtils]: 64: Hoare triple {27193#(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 (= (+ 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)); {26795#true} is VALID [2022-04-08 10:55:45,622 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} {26795#true} #69#return; {27193#(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 (= (+ 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-08 10:55:45,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:55:45,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {27168#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {26877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:55:45,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {26795#true} ~cond := #in~cond; {27168#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:55:45,623 INFO L272 TraceCheckUtils]: 59: Hoare triple {26795#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,623 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26795#true} {26795#true} #67#return; {26795#true} is VALID [2022-04-08 10:55:45,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L272 TraceCheckUtils]: 54: Hoare triple {26795#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {26795#true} assume !false; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {26795#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {26795#true} assume !!(~a~0 != ~b~0); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26795#true} {26795#true} #71#return; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L272 TraceCheckUtils]: 46: Hoare triple {26795#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26795#true} {26795#true} #69#return; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L272 TraceCheckUtils]: 41: Hoare triple {26795#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26795#true} {26795#true} #67#return; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L272 TraceCheckUtils]: 36: Hoare triple {26795#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {26795#true} assume !false; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {26795#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {26795#true} assume !!(~a~0 != ~b~0); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26795#true} {26795#true} #71#return; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L272 TraceCheckUtils]: 28: Hoare triple {26795#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26795#true} {26795#true} #69#return; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L272 TraceCheckUtils]: 23: Hoare triple {26795#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26795#true} {26795#true} #67#return; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L272 TraceCheckUtils]: 18: Hoare triple {26795#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {26795#true} assume !false; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {26795#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26795#true} {26795#true} #65#return; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L272 TraceCheckUtils]: 11: Hoare triple {26795#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26795#true} {26795#true} #63#return; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {26795#true} assume !(0 == ~cond); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {26795#true} ~cond := #in~cond; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {26795#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {26795#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {26795#true} call #t~ret6 := main(); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26795#true} {26795#true} #81#return; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {26795#true} assume true; {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {26795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {26795#true} is VALID [2022-04-08 10:55:45,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {26795#true} call ULTIMATE.init(); {26795#true} is VALID [2022-04-08 10:55:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 102 proven. 26 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2022-04-08 10:55:45,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206146737] [2022-04-08 10:55:45,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986116033] [2022-04-08 10:55:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986116033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:55:45,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:55:45,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 10:55:45,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187570890] [2022-04-08 10:55:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187570890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:45,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:45,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:55:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750156458] [2022-04-08 10:55:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 99 [2022-04-08 10:55:45,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:45,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-04-08 10:55:45,736 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-08 10:55:45,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:55:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:55:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:55:45,737 INFO L87 Difference]: Start difference. First operand 287 states and 344 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-04-08 10:55:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:49,932 INFO L93 Difference]: Finished difference Result 317 states and 383 transitions. [2022-04-08 10:55:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:55:49,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 99 [2022-04-08 10:55:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-04-08 10:55:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-08 10:55:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-04-08 10:55:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-08 10:55:49,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-04-08 10:55:50,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:50,068 INFO L225 Difference]: With dead ends: 317 [2022-04-08 10:55:50,069 INFO L226 Difference]: Without dead ends: 315 [2022-04-08 10:55:50,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:55:50,070 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:55:50,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 243 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:55:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-08 10:55:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2022-04-08 10:55:50,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:50,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:55:50,538 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:55:50,538 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:55:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:50,543 INFO L93 Difference]: Finished difference Result 315 states and 381 transitions. [2022-04-08 10:55:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 381 transitions. [2022-04-08 10:55:50,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:50,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:50,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 315 states. [2022-04-08 10:55:50,544 INFO L87 Difference]: Start difference. First operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 315 states. [2022-04-08 10:55:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:50,548 INFO L93 Difference]: Finished difference Result 315 states and 381 transitions. [2022-04-08 10:55:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 381 transitions. [2022-04-08 10:55:50,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:50,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:50,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:50,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 191 states have (on average 1.1413612565445026) internal successors, (218), 195 states have internal predecessors, (218), 79 states have call successors, (79), 41 states have call predecessors, (79), 40 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:55:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 374 transitions. [2022-04-08 10:55:50,555 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 374 transitions. Word has length 99 [2022-04-08 10:55:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:50,555 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 374 transitions. [2022-04-08 10:55:50,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-04-08 10:55:50,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 311 states and 374 transitions. [2022-04-08 10:55:54,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 373 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 374 transitions. [2022-04-08 10:55:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 10:55:54,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:54,599 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:55:54,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 10:55:54,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 10:55:54,800 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1783053729, now seen corresponding path program 19 times [2022-04-08 10:55:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:54,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69104246] [2022-04-08 10:55:54,801 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:55:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1783053729, now seen corresponding path program 20 times [2022-04-08 10:55:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:54,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579032742] [2022-04-08 10:55:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:54,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:54,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312466175] [2022-04-08 10:55:54,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:54,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:54,830 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:55:54,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 10:55:54,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:54,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:54,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:55:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:54,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:56,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {29296#true} call ULTIMATE.init(); {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {29296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29296#true} {29296#true} #81#return; {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {29296#true} call #t~ret6 := main(); {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {29296#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29296#true} is VALID [2022-04-08 10:55:56,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {29296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29296#true} {29296#true} #63#return; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {29296#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29296#true} {29296#true} #65#return; {29296#true} is VALID [2022-04-08 10:55:56,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {29296#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {29349#(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-08 10:55:56,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {29349#(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; {29349#(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-08 10:55:56,199 INFO L272 TraceCheckUtils]: 18: Hoare triple {29349#(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)); {29296#true} is VALID [2022-04-08 10:55:56,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,199 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29296#true} {29349#(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))} #67#return; {29349#(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-08 10:55:56,200 INFO L272 TraceCheckUtils]: 23: Hoare triple {29349#(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)); {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29296#true} {29349#(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))} #69#return; {29349#(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-08 10:55:56,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {29349#(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)); {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,201 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29296#true} {29349#(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))} #71#return; {29349#(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-08 10:55:56,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {29349#(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); {29349#(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-08 10:55:56,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {29349#(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; {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,202 INFO L272 TraceCheckUtils]: 36: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {29296#true} is VALID [2022-04-08 10:55:56,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29296#true} {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #67#return; {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,203 INFO L272 TraceCheckUtils]: 41: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,204 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29296#true} {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #69#return; {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,204 INFO L272 TraceCheckUtils]: 46: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= 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)); {29296#true} is VALID [2022-04-08 10:55:56,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,205 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29296#true} {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #71#return; {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {29404#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~a~0) (= main_~b~0 main_~y~0) (= main_~r~0 (* (- 1) main_~s~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; {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} assume !false; {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,207 INFO L272 TraceCheckUtils]: 54: Hoare triple {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,208 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29296#true} {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #67#return; {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,208 INFO L272 TraceCheckUtils]: 59: Hoare triple {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,209 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29296#true} {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #69#return; {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,209 INFO L272 TraceCheckUtils]: 64: Hoare triple {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,232 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {29296#true} {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} #71#return; {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} is VALID [2022-04-08 10:55:56,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {29459#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {29511#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:55:56,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {29511#(and (= (+ main_~s~0 main_~r~0) (* (- 1) main_~s~0)) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) (+ main_~b~0 main_~a~0)) (< 0 main_~a~0) (= main_~q~0 0) (not (= main_~b~0 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; {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,234 INFO L272 TraceCheckUtils]: 72: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:56,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,234 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29296#true} {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #67#return; {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,235 INFO L272 TraceCheckUtils]: 77: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:56,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,235 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29296#true} {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #69#return; {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,235 INFO L272 TraceCheckUtils]: 82: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:56,235 INFO L290 TraceCheckUtils]: 83: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,236 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {29296#true} {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #71#return; {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,237 INFO L290 TraceCheckUtils]: 87: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 10:55:56,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {29515#(and (= (+ main_~s~0 main_~r~0) 1) (not (= main_~a~0 main_~y~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= (+ main_~a~0 main_~y~0) (+ main_~x~0 (* (- 1) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0))) (< 0 main_~a~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; {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} is VALID [2022-04-08 10:55:56,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} assume !false; {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} is VALID [2022-04-08 10:55:56,239 INFO L272 TraceCheckUtils]: 90: Hoare triple {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:56,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:56,239 INFO L290 TraceCheckUtils]: 92: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:56,239 INFO L290 TraceCheckUtils]: 93: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:56,240 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29296#true} {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} #67#return; {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} is VALID [2022-04-08 10:55:56,240 INFO L272 TraceCheckUtils]: 95: Hoare triple {29570#(and (<= main_~x~0 (* main_~y~0 3)) (< (* 5 main_~y~0) (* main_~x~0 2)) (not (= main_~x~0 (* main_~y~0 3))) (= (+ 5 main_~r~0) 0) (= main_~p~0 2) (= (* main_~x~0 2) (+ (* 5 main_~y~0) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:56,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {29592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:56,241 INFO L290 TraceCheckUtils]: 97: Hoare triple {29596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29297#false} is VALID [2022-04-08 10:55:56,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {29297#false} assume !false; {29297#false} is VALID [2022-04-08 10:55:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 26 proven. 48 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 10:55:56,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:57,177 INFO L290 TraceCheckUtils]: 98: Hoare triple {29297#false} assume !false; {29297#false} is VALID [2022-04-08 10:55:57,177 INFO L290 TraceCheckUtils]: 97: Hoare triple {29596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29297#false} is VALID [2022-04-08 10:55:57,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {29592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:57,178 INFO L272 TraceCheckUtils]: 95: Hoare triple {29612#(= 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)); {29592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:55:57,179 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29296#true} {29612#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {29612#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:57,179 INFO L290 TraceCheckUtils]: 93: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,179 INFO L290 TraceCheckUtils]: 91: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,179 INFO L272 TraceCheckUtils]: 90: Hoare triple {29612#(= 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)); {29296#true} is VALID [2022-04-08 10:55:57,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {29612#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {29612#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:57,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {29634#(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; {29612#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:55:57,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {29634#(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); {29634#(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-08 10:55:57,397 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {29296#true} {29634#(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)))} #71#return; {29634#(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-08 10:55:57,397 INFO L290 TraceCheckUtils]: 85: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,397 INFO L290 TraceCheckUtils]: 83: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,397 INFO L272 TraceCheckUtils]: 82: Hoare triple {29634#(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)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:57,412 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29296#true} {29634#(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)))} #69#return; {29634#(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-08 10:55:57,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,412 INFO L290 TraceCheckUtils]: 78: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,412 INFO L272 TraceCheckUtils]: 77: Hoare triple {29634#(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)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:57,413 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29296#true} {29634#(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)))} #67#return; {29634#(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-08 10:55:57,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,413 INFO L272 TraceCheckUtils]: 72: Hoare triple {29634#(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)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:57,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {29634#(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 !false; {29634#(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-08 10:55:57,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {29689#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~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; {29634#(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-08 10:55:57,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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); {29689#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~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-08 10:55:57,598 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {29296#true} {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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))))} #71#return; {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:55:57,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,598 INFO L272 TraceCheckUtils]: 64: Hoare triple {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:57,599 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29296#true} {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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))))} #69#return; {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:55:57,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,599 INFO L272 TraceCheckUtils]: 59: Hoare triple {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:57,600 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29296#true} {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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))))} #67#return; {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:55:57,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:57,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:57,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:57,600 INFO L272 TraceCheckUtils]: 54: Hoare triple {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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)); {29296#true} is VALID [2022-04-08 10:55:57,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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; {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:55:58,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {29693#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~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-08 10:55:58,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} assume !!(~a~0 != ~b~0); {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,800 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29296#true} {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} #71#return; {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,800 INFO L272 TraceCheckUtils]: 46: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,801 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29296#true} {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} #69#return; {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,801 INFO L272 TraceCheckUtils]: 41: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,802 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29296#true} {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} #67#return; {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,802 INFO L272 TraceCheckUtils]: 36: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} assume !false; {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {29745#(or (<= (* main_~a~0 2) (* main_~b~0 3)) (< (* main_~b~0 2) main_~a~0) (= main_~a~0 (* main_~b~0 2)) (= (+ (* main_~a~0 2) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)) (* main_~b~0 3))))} is VALID [2022-04-08 10:55:58,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} assume !!(~a~0 != ~b~0); {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,946 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29296#true} {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} #71#return; {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,946 INFO L272 TraceCheckUtils]: 28: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29296#true} {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} #69#return; {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L272 TraceCheckUtils]: 23: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29296#true} {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} #67#return; {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} assume !false; {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {29296#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {29800#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (* main_~b~0 2)) (< (* main_~b~0 3) main_~a~0) (= (+ (* 2 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (* (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) 2) (* main_~b~0 3)) (+ (* main_~a~0 2) (* (- 2) main_~b~0) (* (* main_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0)))) (<= (* main_~a~0 2) (* 5 main_~b~0)))} is VALID [2022-04-08 10:55:58,949 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29296#true} {29296#true} #65#return; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {29296#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29296#true} {29296#true} #63#return; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {29296#true} assume !(0 == ~cond); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {29296#true} ~cond := #in~cond; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {29296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {29296#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {29296#true} call #t~ret6 := main(); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29296#true} {29296#true} #81#return; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {29296#true} assume true; {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {29296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29296#true} is VALID [2022-04-08 10:55:58,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {29296#true} call ULTIMATE.init(); {29296#true} is VALID [2022-04-08 10:55:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 26 proven. 48 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 10:55:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:58,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579032742] [2022-04-08 10:55:58,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:58,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312466175] [2022-04-08 10:55:58,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312466175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:55:58,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:55:58,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-08 10:55:58,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69104246] [2022-04-08 10:55:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69104246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:55:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172814271] [2022-04-08 10:55:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 99 [2022-04-08 10:55:58,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:58,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 10:55:59,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:55:59,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:55:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:55:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:55:59,019 INFO L87 Difference]: Start difference. First operand 311 states and 374 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 10:56:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:01,566 INFO L93 Difference]: Finished difference Result 352 states and 424 transitions. [2022-04-08 10:56:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:56:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 99 [2022-04-08 10:56:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 10:56:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 10:56:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 10:56:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-04-08 10:56:01,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2022-04-08 10:56:01,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:01,719 INFO L225 Difference]: With dead ends: 352 [2022-04-08 10:56:01,719 INFO L226 Difference]: Without dead ends: 350 [2022-04-08 10:56:01,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:56:01,721 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:01,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 245 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:56:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-08 10:56:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2022-04-08 10:56:02,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:02,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:56:02,152 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:56:02,152 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:56:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:02,157 INFO L93 Difference]: Finished difference Result 350 states and 422 transitions. [2022-04-08 10:56:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2022-04-08 10:56:02,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:02,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:02,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 350 states. [2022-04-08 10:56:02,159 INFO L87 Difference]: Start difference. First operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) Second operand 350 states. [2022-04-08 10:56:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:02,164 INFO L93 Difference]: Finished difference Result 350 states and 422 transitions. [2022-04-08 10:56:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2022-04-08 10:56:02,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:02,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:02,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:02,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 200 states have (on average 1.13) internal successors, (226), 204 states have internal predecessors, (226), 79 states have call successors, (79), 44 states have call predecessors, (79), 43 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 10:56:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 382 transitions. [2022-04-08 10:56:02,171 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 382 transitions. Word has length 99 [2022-04-08 10:56:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:02,171 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 382 transitions. [2022-04-08 10:56:02,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 10:56:02,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 382 transitions. [2022-04-08 10:56:07,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 381 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 382 transitions. [2022-04-08 10:56:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 10:56:07,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:07,124 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:07,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 10:56:07,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:07,324 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash 43761953, now seen corresponding path program 21 times [2022-04-08 10:56:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:07,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102414403] [2022-04-08 10:56:07,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:56:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash 43761953, now seen corresponding path program 22 times [2022-04-08 10:56:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:07,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882937802] [2022-04-08 10:56:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:07,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:07,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547595355] [2022-04-08 10:56:07,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:56:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:07,338 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:56:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:56:07,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:56:07,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:07,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 10:56:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:56:09,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {31957#true} call ULTIMATE.init(); {31957#true} is VALID [2022-04-08 10:56:09,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {31957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31957#true} {31957#true} #81#return; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {31957#true} call #t~ret6 := main(); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {31957#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {31957#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31957#true} {31957#true} #63#return; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L272 TraceCheckUtils]: 11: Hoare triple {31957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31957#true} {31957#true} #65#return; {31957#true} is VALID [2022-04-08 10:56:09,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {31957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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; {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,707 INFO L272 TraceCheckUtils]: 18: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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)); {31957#true} is VALID [2022-04-08 10:56:09,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,707 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {31957#true} {32010#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,707 INFO L272 TraceCheckUtils]: 23: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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)); {31957#true} is VALID [2022-04-08 10:56:09,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {31957#true} ~cond := #in~cond; {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:09,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,708 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} {32010#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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)); {31957#true} is VALID [2022-04-08 10:56:09,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,709 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31957#true} {32010#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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); {32010#(and (<= 1 main_~s~0) (= 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-08 10:56:09,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {32010#(and (<= 1 main_~s~0) (= 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;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} assume !false; {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,710 INFO L272 TraceCheckUtils]: 36: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {31957#true} {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} #67#return; {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,711 INFO L272 TraceCheckUtils]: 41: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31957#true} {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} #69#return; {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,711 INFO L272 TraceCheckUtils]: 46: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,712 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {31957#true} {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} #71#return; {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} assume !!(~a~0 != ~b~0); {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} is VALID [2022-04-08 10:56:09,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {32067#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (< 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))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} assume !false; {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,759 INFO L272 TraceCheckUtils]: 54: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,759 INFO L290 TraceCheckUtils]: 55: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,793 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {31957#true} {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} #67#return; {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,794 INFO L272 TraceCheckUtils]: 59: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,796 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31957#true} {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} #69#return; {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,796 INFO L272 TraceCheckUtils]: 64: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,796 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {31957#true} {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} #71#return; {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} assume !!(~a~0 != ~b~0); {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} is VALID [2022-04-08 10:56:09,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {32122#(and (<= (+ main_~r~0 1) 0) (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~q~0 (+ (* (- 2) main_~p~0) 1)) (= (* (- 2) main_~r~0) main_~s~0) (< 0 main_~a~0) (not (< main_~x~0 (* main_~a~0 2))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} is VALID [2022-04-08 10:56:09,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} assume !false; {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} is VALID [2022-04-08 10:56:09,800 INFO L272 TraceCheckUtils]: 72: Hoare triple {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,800 INFO L290 TraceCheckUtils]: 73: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,800 INFO L290 TraceCheckUtils]: 75: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,801 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {31957#true} {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} #67#return; {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} is VALID [2022-04-08 10:56:09,801 INFO L272 TraceCheckUtils]: 77: Hoare triple {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,801 INFO L290 TraceCheckUtils]: 78: Hoare triple {31957#true} ~cond := #in~cond; {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:09,801 INFO L290 TraceCheckUtils]: 79: Hoare triple {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,802 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} {32177#(and (= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~y~0)) main_~a~0) (not (< (* main_~y~0 2) main_~x~0)) (= (+ (* (- 2) main_~s~0) (* (- 2) main_~r~0)) main_~s~0) (= main_~b~0 (+ (* (- 1) main_~x~0) (* main_~y~0 2))) (< main_~y~0 main_~x~0) (= (- 1) main_~q~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= (+ main_~s~0 main_~r~0 1) 0))} #69#return; {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,803 INFO L272 TraceCheckUtils]: 82: Hoare triple {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {31957#true} ~cond := #in~cond; {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:09,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {32035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:09,804 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} #71#return; {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,804 INFO L290 TraceCheckUtils]: 87: Hoare triple {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} assume !!(~a~0 != ~b~0); {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {32211#(and (= main_~x~0 (+ main_~b~0 main_~a~0 main_~y~0)) (= (+ main_~q~0 main_~p~0) 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)) (= (+ (* main_~s~0 3) (* main_~r~0 2)) 0) (<= main_~x~0 (* main_~y~0 2)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} assume !false; {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,809 INFO L272 TraceCheckUtils]: 90: Hoare triple {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:09,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:09,810 INFO L290 TraceCheckUtils]: 92: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:09,810 INFO L290 TraceCheckUtils]: 93: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:09,810 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31957#true} {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} #67#return; {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 10:56:09,814 INFO L272 TraceCheckUtils]: 95: Hoare triple {32233#(and (= (* main_~y~0 2) (+ (* (- 1) main_~a~0) (* main_~y~0 (div (* (- 2) main_~r~0) 5)) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~y~0 main_~x~0) (= (+ (- 2) main_~p~0) 1) (= main_~x~0 (+ (* (- 1) main_~a~0) (* (- 2) main_~x~0) main_~y~0 (* (* main_~y~0 (div (* (- 2) main_~r~0) 5)) 2) (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0)))) (= (mod (* main_~r~0 3) 5) 0) (<= main_~x~0 (* main_~y~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:09,815 INFO L290 TraceCheckUtils]: 96: Hoare triple {32255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:09,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {32259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31958#false} is VALID [2022-04-08 10:56:09,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {31958#false} assume !false; {31958#false} is VALID [2022-04-08 10:56:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-04-08 10:56:09,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:42,958 INFO L290 TraceCheckUtils]: 98: Hoare triple {31958#false} assume !false; {31958#false} is VALID [2022-04-08 10:56:42,958 INFO L290 TraceCheckUtils]: 97: Hoare triple {32259#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31958#false} is VALID [2022-04-08 10:56:42,958 INFO L290 TraceCheckUtils]: 96: Hoare triple {32255#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32259#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:42,959 INFO L272 TraceCheckUtils]: 95: Hoare triple {32275#(= 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)); {32255#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:56:42,960 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {31957#true} {32275#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {32275#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:56:42,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:42,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:42,960 INFO L290 TraceCheckUtils]: 91: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:42,960 INFO L272 TraceCheckUtils]: 90: Hoare triple {32275#(= 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)); {31957#true} is VALID [2022-04-08 10:56:42,960 INFO L290 TraceCheckUtils]: 89: Hoare triple {32275#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {32275#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:56:43,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {32297#(= (+ 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; {32275#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 10:56:43,163 INFO L290 TraceCheckUtils]: 87: Hoare triple {32297#(= (+ 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); {32297#(= (+ 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-08 10:56:43,164 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} {32304#(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)))))} #71#return; {32297#(= (+ 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-08 10:56:43,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:43,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {32314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:43,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {31957#true} ~cond := #in~cond; {32314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:56:43,165 INFO L272 TraceCheckUtils]: 82: Hoare triple {32304#(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)); {31957#true} is VALID [2022-04-08 10:56:43,167 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} {31957#true} #69#return; {32304#(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-08 10:56:43,167 INFO L290 TraceCheckUtils]: 80: Hoare triple {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:43,167 INFO L290 TraceCheckUtils]: 79: Hoare triple {32314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {32039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {31957#true} ~cond := #in~cond; {32314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:56:43,168 INFO L272 TraceCheckUtils]: 77: Hoare triple {31957#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {31957#true} {31957#true} #67#return; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L272 TraceCheckUtils]: 72: Hoare triple {31957#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {31957#true} assume !false; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {31957#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {31957#true} assume !!(~a~0 != ~b~0); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {31957#true} {31957#true} #71#return; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L272 TraceCheckUtils]: 64: Hoare triple {31957#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31957#true} {31957#true} #69#return; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L272 TraceCheckUtils]: 59: Hoare triple {31957#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {31957#true} {31957#true} #67#return; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L272 TraceCheckUtils]: 54: Hoare triple {31957#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {31957#true} assume !false; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {31957#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {31957#true} assume !!(~a~0 != ~b~0); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {31957#true} {31957#true} #71#return; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L272 TraceCheckUtils]: 46: Hoare triple {31957#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31957#true} {31957#true} #69#return; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L272 TraceCheckUtils]: 41: Hoare triple {31957#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,169 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {31957#true} {31957#true} #67#return; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L272 TraceCheckUtils]: 36: Hoare triple {31957#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {31957#true} assume !false; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {31957#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {31957#true} assume !!(~a~0 != ~b~0); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31957#true} {31957#true} #71#return; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L272 TraceCheckUtils]: 28: Hoare triple {31957#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31957#true} {31957#true} #69#return; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {31957#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {31957#true} {31957#true} #67#return; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {31957#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {31957#true} assume !false; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {31957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31957#true} {31957#true} #65#return; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L272 TraceCheckUtils]: 11: Hoare triple {31957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31957#true} {31957#true} #63#return; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {31957#true} assume !(0 == ~cond); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {31957#true} ~cond := #in~cond; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {31957#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {31957#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {31957#true} call #t~ret6 := main(); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31957#true} {31957#true} #81#return; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {31957#true} assume true; {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {31957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {31957#true} is VALID [2022-04-08 10:56:43,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {31957#true} call ULTIMATE.init(); {31957#true} is VALID [2022-04-08 10:56:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-04-08 10:56:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882937802] [2022-04-08 10:56:43,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547595355] [2022-04-08 10:56:43,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547595355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:56:43,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:56:43,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 10:56:43,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102414403] [2022-04-08 10:56:43,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102414403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:43,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:43,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:56:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944922184] [2022-04-08 10:56:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:43,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 99 [2022-04-08 10:56:43,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:43,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-08 10:56:43,284 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-08 10:56:43,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:56:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:43,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:56:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:56:43,284 INFO L87 Difference]: Start difference. First operand 323 states and 382 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-08 10:56:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:51,651 INFO L93 Difference]: Finished difference Result 357 states and 424 transitions. [2022-04-08 10:56:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:56:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 99 [2022-04-08 10:56:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-08 10:56:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-08 10:56:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-08 10:56:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-04-08 10:56:51,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-04-08 10:56:51,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:51,891 INFO L225 Difference]: With dead ends: 357 [2022-04-08 10:56:51,891 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 10:56:51,892 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:56:51,892 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:51,892 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 245 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:56:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 10:56:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 334. [2022-04-08 10:56:52,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:52,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-08 10:56:52,391 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-08 10:56:52,404 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-08 10:56:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:52,423 INFO L93 Difference]: Finished difference Result 355 states and 422 transitions. [2022-04-08 10:56:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 422 transitions. [2022-04-08 10:56:52,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:52,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:52,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) Second operand 355 states. [2022-04-08 10:56:52,425 INFO L87 Difference]: Start difference. First operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) Second operand 355 states. [2022-04-08 10:56:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:52,430 INFO L93 Difference]: Finished difference Result 355 states and 422 transitions. [2022-04-08 10:56:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 422 transitions. [2022-04-08 10:56:52,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:52,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:52,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:52,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 208 states have (on average 1.1298076923076923) internal successors, (235), 211 states have internal predecessors, (235), 80 states have call successors, (80), 46 states have call predecessors, (80), 45 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-08 10:56:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 393 transitions. [2022-04-08 10:56:52,437 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 393 transitions. Word has length 99 [2022-04-08 10:56:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:52,437 INFO L478 AbstractCegarLoop]: Abstraction has 334 states and 393 transitions. [2022-04-08 10:56:52,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-08 10:56:52,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 334 states and 393 transitions. [2022-04-08 10:56:56,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 392 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:56:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 393 transitions. [2022-04-08 10:56:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 10:56:56,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:56,601 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:56:56,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 10:56:56,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:56,802 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1429965347, now seen corresponding path program 23 times [2022-04-08 10:56:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:56,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619158200] [2022-04-08 10:56:56,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:56:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1429965347, now seen corresponding path program 24 times [2022-04-08 10:56:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:56,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32304303] [2022-04-08 10:56:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:56,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645500531] [2022-04-08 10:56:56,811 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:56:56,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:56,819 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:56:56,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:56:57,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:56:57,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:57,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 10:56:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:57,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:05,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {34662#true} call ULTIMATE.init(); {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {34662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34662#true} {34662#true} #81#return; {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {34662#true} call #t~ret6 := main(); {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {34662#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34662#true} is VALID [2022-04-08 10:57:05,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {34662#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34662#true} {34662#true} #63#return; {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {34662#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {34662#true} ~cond := #in~cond; {34703#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 10:57:05,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {34703#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34707#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:57:05,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {34707#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34707#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 10:57:05,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34707#(not (= |assume_abort_if_not_#in~cond| 0))} {34662#true} #65#return; {34714#(<= 1 main_~y~0)} is VALID [2022-04-08 10:57:05,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {34714#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {34718#(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-08 10:57:05,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {34718#(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; {34718#(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-08 10:57:05,044 INFO L272 TraceCheckUtils]: 18: Hoare triple {34718#(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)); {34662#true} is VALID [2022-04-08 10:57:05,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,044 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34662#true} {34718#(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))} #67#return; {34718#(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-08 10:57:05,045 INFO L272 TraceCheckUtils]: 23: Hoare triple {34718#(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)); {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34662#true} {34718#(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))} #69#return; {34718#(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-08 10:57:05,045 INFO L272 TraceCheckUtils]: 28: Hoare triple {34718#(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)); {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,046 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {34662#true} {34718#(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))} #71#return; {34718#(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-08 10:57:05,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {34718#(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); {34718#(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-08 10:57:05,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {34718#(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; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !false; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,048 INFO L272 TraceCheckUtils]: 36: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #67#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,049 INFO L272 TraceCheckUtils]: 41: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #69#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,049 INFO L272 TraceCheckUtils]: 46: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,050 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #71#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !!(~a~0 != ~b~0); {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !false; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,051 INFO L272 TraceCheckUtils]: 54: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,052 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #67#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,052 INFO L272 TraceCheckUtils]: 59: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,053 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #69#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,053 INFO L272 TraceCheckUtils]: 64: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,053 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {34662#true} {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #71#return; {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {34773#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !!(~a~0 != ~b~0); {34879#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-08 10:57:05,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {34879#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0) (not (= main_~b~0 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; {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,055 INFO L290 TraceCheckUtils]: 71: Hoare triple {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !false; {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,055 INFO L272 TraceCheckUtils]: 72: Hoare triple {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,056 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34662#true} {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #67#return; {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,056 INFO L272 TraceCheckUtils]: 77: Hoare triple {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {34662#true} ~cond := #in~cond; {34662#true} is VALID [2022-04-08 10:57:05,056 INFO L290 TraceCheckUtils]: 79: Hoare triple {34662#true} assume !(0 == ~cond); {34662#true} is VALID [2022-04-08 10:57:05,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {34662#true} assume true; {34662#true} is VALID [2022-04-08 10:57:05,057 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34662#true} {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #69#return; {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,057 INFO L272 TraceCheckUtils]: 82: Hoare triple {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {34662#true} ~cond := #in~cond; {34923#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:05,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {34923#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:57:05,058 INFO L290 TraceCheckUtils]: 85: Hoare triple {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:57:05,058 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} {34883#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} #71#return; {34934#(and (= (+ (* (- 1) main_~p~0) 1) 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))) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {34934#(and (= (+ (* (- 1) main_~p~0) 1) 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))) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume !!(~a~0 != ~b~0); {34934#(and (= (+ (* (- 1) main_~p~0) 1) 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))) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {34934#(and (= (+ (* (- 1) main_~p~0) 1) 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))) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= (- 1) main_~r~0) (< 0 main_~a~0) (<= 1 main_~y~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {34941#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0 (* main_~y~0 main_~s~0)) main_~x~0) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~q~0 main_~p~0) 1) (< 0 main_~a~0) (= (+ main_~s~0 main_~r~0 1) 0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {34941#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0 (* main_~y~0 main_~s~0)) main_~x~0) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~q~0 main_~p~0) 1) (< 0 main_~a~0) (= (+ main_~s~0 main_~r~0 1) 0) (<= 1 main_~y~0))} assume !false; {34941#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0 (* main_~y~0 main_~s~0)) main_~x~0) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~q~0 main_~p~0) 1) (< 0 main_~a~0) (= (+ main_~s~0 main_~r~0 1) 0) (<= 1 main_~y~0))} is VALID [2022-04-08 10:57:05,061 INFO L272 TraceCheckUtils]: 90: Hoare triple {34941#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0 (* main_~y~0 main_~s~0)) main_~x~0) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~q~0 main_~p~0) 1) (< 0 main_~a~0) (= (+ main_~s~0 main_~r~0 1) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {34662#true} is VALID [2022-04-08 10:57:05,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {34662#true} ~cond := #in~cond; {34923#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:05,062 INFO L290 TraceCheckUtils]: 92: Hoare triple {34923#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:57:05,062 INFO L290 TraceCheckUtils]: 93: Hoare triple {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:57:05,066 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {34927#(not (= |__VERIFIER_assert_#in~cond| 0))} {34941#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0 (* main_~y~0 main_~s~0)) main_~x~0) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~q~0 main_~p~0) 1) (< 0 main_~a~0) (= (+ main_~s~0 main_~r~0 1) 0) (<= 1 main_~y~0))} #67#return; {34960#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~x~0 (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* main_~y~0 (+ (- 1) (* (- 1) main_~r~0))) main_~a~0 main_~y~0)) (< 0 main_~a~0) (<= 1 main_~y~0) (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~r~0) 1) (* main_~p~0 (+ (- 1) (* (- 1) main_~r~0)))))} is VALID [2022-04-08 10:57:05,066 INFO L272 TraceCheckUtils]: 95: Hoare triple {34960#(and (not (= (+ main_~a~0 main_~y~0) main_~x~0)) (<= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~x~0 (+ (* (+ (* (- 1) main_~p~0) 1) main_~x~0) (* main_~y~0 (+ (- 1) (* (- 1) main_~r~0))) main_~a~0 main_~y~0)) (< 0 main_~a~0) (<= 1 main_~y~0) (= (+ (* (+ (* (- 1) main_~p~0) 1) main_~r~0) 1) (* main_~p~0 (+ (- 1) (* (- 1) main_~r~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:57:05,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {34964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:05,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {34968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34663#false} is VALID [2022-04-08 10:57:05,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {34663#false} assume !false; {34663#false} is VALID [2022-04-08 10:57:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-04-08 10:57:05,068 INFO L328 TraceCheckSpWp]: Computing backward predicates...